Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications

In this paper, an efficient algorithm for implementing MDCT/IMDCT of lengths N = 5 ldr 2m (m ges 2) is presented. Transforms for such lengths are of interest for speech and audio coding applications, such as recently issued and/or emerging standards G.729.1, G.EV-VBR, and EVRC-WB. In our design we utilize a mapping of MDCT of size N into JV/2-point DCT-IV and DCT-II with isolated pre- multiplications, which are subsequently moved in the windowing stage. We show that such a modified window is piece-wise symmetric, and can be stored using N/2 words. In our algorithm we also use an efficient factorization of 5- point DCT-II which requires only 4 multiplications by irrational factors. We compare our proposed algorithm with several alternative implementations and show that our design offers practically appreciable reduction in complexity and memory usage.

[1]  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).

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

[3]  Michael T. Heideman,et al.  Computation of an odd-length DCT from a real-valued DFT of the same length , 1992, IEEE Trans. Signal Process..

[4]  Chi-Wah Kok,et al.  Fast algorithm for computing discrete cosine transform , 1997, IEEE Trans. Signal Process..

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

[6]  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.

[7]  Russell M. Mersereau,et al.  On fast algorithms for computing the inverse modified discrete cosine transform , 1999, IEEE Signal Processing Letters.

[8]  Henrique S. Malvar,et al.  Signal processing with lapped transforms , 1992 .

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

[10]  K. Rao,et al.  Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations , 2006 .

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

[12]  Pierre Duhamel,et al.  A fast algorithm for the implementation of filter banks based on 'time domain aliasing cancellation' , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.