Short‐critical‐path and structurally orthogonal scaled CORDIC‐based approximations of the eight‐point discrete cosine transform
Open Access
- 1 May 2013
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Circuits, Devices & Systems
- Vol. 7 (3) , 150-158
Abstract
A family of multiplierless transforms is presented that approximate the eight‐point type‐II discrete cosine transform (DCT) as accurately as the state‐of‐the‐art scaled DCT schemes, but having 14–17% shorter critical paths (1/6 or 1/7 less adders). Compared to the existing solutions that use the coordinate rotation digital computer (CORDIC) algorithm, the advantage of higher throughput is accompanied by saving additions. Only some lifting‐based BinDCT schemes require less adders in total, in spite of longer critical paths. The transforms have been derived from the fast Loeffler's algorithm by replacing the rotation stage with unfolded CORDIC iterations, which have been arranged so that two rotation approximations use the same scaling. This is equivalent to imposing structural orthogonality (losslessness) on a system, from which the scaling can then be extracted so as to shorten the critical path. Supporting ideas are a notation for more conveniently describing CORDIC circuits, and an angle conversion that allows rotations to be approximated using an extended set of CORDIC circuits. The research results have been validated by field programmable gate array‐based hardware design experiments and by usability tests based on a software JPEG codec.Keywords
Funding Information
- Politechnika Bialostocka (S/WI/1/2013)
This publication has 22 references indexed in Scilit:
- Low-power and high-quality Cordic-based Loeffler DCT for signal processingIET Circuits, Devices & Systems, 2007
- Low-power multiplierless DCT architecture using image correlationIEEE Transactions on Consumer Electronics, 2004
- A high-performance/low-latency vector rotational CORDIC architecture based on extended elementary angle set and trellis-based searching schemesIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2003
- Rapid Prototyping of Field Programmable Gate Array-Based Discrete Cosine Transform ApproximationsEURASIP Journal on Advances in Signal Processing, 2003
- A scaled DCT architecture with the CORDIC algorithmIEEE Transactions on Signal Processing, 2002
- Fast multiplierless approximations of the DCT with the lifting schemeIEEE Transactions on Signal Processing, 2001
- Multirate filter banks and transform coding gainIEEE Transactions on Signal Processing, 1998
- Parameterization of orthogonal wavelet transforms and their implementationIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1998
- A multiscale relaxation algorithm for SNR maximization in nonorthogonal subband codingIEEE Transactions on Image Processing, 1995
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977