An efficient hardware accelerator architecture for implementing fast IMDCT computation

In this paper, a new fast inverse modified discrete cosine transform (IMDCT) algorithm and an efficient hardware accelerator architecture are proposed. The proposed fast algorithm is derived from our previously presented type-IV discrete cosine transform/type-IV discrete sine transform (DCT-IV/DST-IV) decomposition algorithm. After transformations of DST-IV to DCT-IV and DCT-IV to IDCT-II, the computational items are further recombined to share hardware resources. Experimental results show that the proposed algorithm's computational cycles are decreased by 20% and 51%, respectively compared with two other reported fast algorithms. By employing resource sharing and multiplexing techniques, the proposed hardware accelerator reduces 24% and 48% of transistors compared with two other ones, respectively.

[1]  Jar-Ferr Yang,et al.  Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT and subband synthesis filtering , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[2]  Hussein Baher,et al.  Analog & digital signal processing , 1990 .

[3]  T.W. Fox,et al.  Goertzel implementations of the forward and inverse modified discrete cosine transform , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[4]  Jürgen Becker,et al.  A Novel Recursive Algorithm for Bit-Efficient Realization of Arbitrary Length Inverse Modified Cosine Transforms , 2008, 2008 Design, Automation and Test in Europe.

[5]  J. Yang,et al.  Regular implementation algorithms of time domain aliasing cancellation , 1996 .

[6]  Vladimir Britanak,et al.  A new fast algorithm for the unified forward and inverse MDCT/MDST computation , 2002, Signal Process..

[7]  Hui Li,et al.  A New Decomposition Algorithm of DCT-IV/DST-IV for Realizing Fast IMDCT Computation , 2009, IEEE Signal Processing Letters.

[8]  John P. Uyemura Introduction to VLSI Circuits and Systems , 2001 .

[9]  John Princen,et al.  Subband/Transform coding using filter bank designs based on time domain aliasing cancellation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  John Princen,et al.  Analysis/Synthesis filter bank design based on time domain aliasing cancellation , 1986, IEEE Trans. Acoust. Speech Signal Process..

[11]  Jie-Cherng Liu,et al.  Regressive implementations for the forward and inverse MDCT in MPEG audio coding , 1996, IEEE Signal Process. Lett..

[12]  Yuriy A. Reznik,et al.  Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[13]  Mu-Huo Cheng,et al.  Fast IMDCT and MDCT algorithms - a matrix approach , 2003, IEEE Trans. Signal Process..

[14]  Trieu-Kien Truong,et al.  Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding , 2006, Signal Process..

[15]  Jar-Ferr Yang,et al.  Recursive architectures for the forward and inverse modified discrete cosine transforms , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[16]  Huazhong Shu,et al.  Radix-3 Algorithm for the Fast Computation of Forward and Inverse MDCT , 2007, IEEE Signal Processing Letters.

[17]  Che-Hong Chen,et al.  Recursive architectures for realizing modified discrete cosine transform and its inverse , 2003, IEEE Trans. Circuits Syst. II Express Briefs.

[18]  Szu-Wei Lee Improved algorithm for efficient computation of the forward and backward MDCT in MPEG audio coder , 2001 .

[19]  Zhongde Wang Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[20]  Gerhard Fettweis,et al.  New Recursive Algorithms for the Unified Forward and Inverse MDCT/MDST , 2003, J. VLSI Signal Process..

[21]  Gerhard Fettweis,et al.  New recursive algorithms for the forward and inverse MDCT , 2001, 2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578).

[22]  Gerhard Fettweis,et al.  Computation of forward and inverse MDCT using Clenshaw's recurrence formula , 2003, IEEE Trans. Signal Process..

[23]  Jiasong Wu,et al.  Mixed-Radix Algorithm for the Computation of Forward and Inverse MDCTs , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.