2004
DOI: 10.1109/tce.2004.1277872
|View full text |Cite
|
Sign up to set email alerts
|

Low-power multiplierless DCT architecture using image correlation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…The fixed-rotation ACor happened when the input angle of z 0 is known. Fixed-rotation ACor implementations were common in CORDIC-based DCT SFGs [14,15,24]. With the known z 0 -value, the iteration process of the z j becomes a pre-determination process.…”
Section: The Fixed-rotation Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…The fixed-rotation ACor happened when the input angle of z 0 is known. Fixed-rotation ACor implementations were common in CORDIC-based DCT SFGs [14,15,24]. With the known z 0 -value, the iteration process of the z j becomes a pre-determination process.…”
Section: The Fixed-rotation Implementationmentioning
confidence: 99%
“…The worthmentioned works were the BinDCT of J. Liang and T. D. Tran in 2001 [8], approximate DCT of M. Parfieniuk et al in 2013 [9], integer DCT of P. K. Meher et al in 2014 [10], scalable orthogonal approximation DCT of M. Jridi et al in 2015 [11], adaptive approximate DCT of M. Masera et al in 2016 [12], and optimized real-valued DCT of S. Chatterjee and K. Sarawadekar in 2018 [13]. Besides the above methods, the COordinate Rotation DIgital Computer (CORDIC) approach was also among the well-known ways to create a high-speed DCT SFG, and several CORDICbased DCT implementations had been proposed lately [14,15,16,17]. The idea of Adaptive CORDIC (ACor) was first introduced by Y. H. Hu and S. Naganathan in 1993 [18] to reduce the number of iteration step.…”
Section: Introductionmentioning
confidence: 99%
“…There are many CORDIC-based DCT designs had been proposed lately [11][12][13]. The CORDICbased DCT architecture can be seen as an approximation implementation.…”
Section: Introductionmentioning
confidence: 99%
“…The technique which uses Ramanujan numbers for calculating cosine values and uses Chebyshev type recursion to compute DCT [12] was also proposed. A low power multiplier-less DCT was presented in [13], and it reduces the switching power consumption around 26 % by removing unnecessary arithmetic operations on unused bits during the CORDlC calculations. The complexity of DCT computation was reduced in [14] by optimizing the Loeffler DCT, based on the CORDlC algorithm.…”
Section: Introductionmentioning
confidence: 99%