An improved scaled DCT architecture

This paper presents an efficient architecture for computing the eight-point 1D scaled DCT (discrete cosine transform) with a new algorithm based on a selected Loeffler DCT scheme whose multiplications are placed in the last stage. The proposed DCT architecture does not require any scaling compensation in the computation. Furthermore, a multiplication approximation method is developed, which is more efficient than traditional CORDIC (coordinate rotation digital computer)-based algorithms. Compared to the latest work (Sun et al., 2007), the proposed approach can save 14% addition operations for the same precision requirement and the path delay can be significantly reduced as well.

[1]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[2]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[3]  Shanq-Jang Ruan,et al.  Low-power and high-quality Cordic-based Loeffler DCT for signal processing , 2007, IET Circuits Devices Syst..

[4]  Jinsang Kim,et al.  Low-power multiplierless DCT architecture using image correlation , 2004, IEEE Trans. Consumer Electron..

[5]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .

[6]  Constantinos E. Goutis,et al.  A fast DCT processor, based on special purpose CORDIC rotators , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[7]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[8]  E. Feig,et al.  On the multiplicative complexity of discrete cosine transforms , 1992, IEEE Trans. Inf. Theory.

[9]  Y. Arai,et al.  A Fast DCT-SQ Scheme for Images , 1988 .

[10]  Earl E. Swartzlander,et al.  A scaled DCT architecture with the CORDIC algorithm , 2002, IEEE Trans. Signal Process..