2019
DOI: 10.1109/tcsi.2018.2868513
|View full text |Cite
|
Sign up to set email alerts
|

Power-, Area-, and Compression-Efficient Eight-Point Approximate 2-D Discrete Tchebichef Transform Hardware Design Combining Truncation Pruning and Efficient Transposition Buffers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(4 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…Finally, the synthesis tool runs again but using as input the previously generated netlist and the stimuli file for the power estimation. Therefore, we use a methodology for precise power dissipation extraction with the following steps [19]. First, all designs are synthesized with the Cadence Genus Synthesis [20] tool with the Physically-Aware Layout Estimation (PLE) mode, which includes an estimation of the wire length and the effects of these wires in terms of area, power dissipation and critical path.…”
Section: A Power Extraction Methodologymentioning
confidence: 99%
“…Finally, the synthesis tool runs again but using as input the previously generated netlist and the stimuli file for the power estimation. Therefore, we use a methodology for precise power dissipation extraction with the following steps [19]. First, all designs are synthesized with the Cadence Genus Synthesis [20] tool with the Physically-Aware Layout Estimation (PLE) mode, which includes an estimation of the wire length and the effects of these wires in terms of area, power dissipation and critical path.…”
Section: A Power Extraction Methodologymentioning
confidence: 99%
“…e proposed architecture maximally reused the hardware resources by rearranging the order of input data for different transform sizes while still exploiting the butterfly property. In [9], a new approximation for the 8-point discrete tchebichef transform was proposed with a higher power-and compression efficiency by exploring coefficient truncation. In [10], an image-dependent optimum nonnegative integer bit allocation algorithm was proposed, which was then mapped into desired image-independent solution via utilization of a prepared combined image and proposed modified step size mapping technique.…”
Section: Related Workmentioning
confidence: 99%
“…Another clear example of data approximation, acting on both data precision and amount, is the work proposed by Paim et. al [41] on approximating the transformation step, that is typical of video coding applications. Transform operations are pervasive in video coding algorithms.…”
Section: Data Level Approximationmentioning
confidence: 99%
“…Paim et. al [41], on the top of an already approximated (computational level approximation that will be discussed later on) version of the DTT matrix [40], apply truncation and pruning in order to simplify the computation and the system (an hardware accelerator) itself, resulting in area, power and compression efficiency improvements. Firstly, a quality-driven quantization of the DTT matrix coefficients, that is a common process in computational level approximation of transform matrices, has been performed.…”
Section: Data Level Approximationmentioning
confidence: 99%