New Recursive Algorithms for the Unified Forward and Inverse MDCT/MDST

Forward and inverse MDCT are two of the most computationally intensive operations in the MPEG audio coding standard. In this paper we derive sinusoidal recursive formulas for transforming kernels of the MDCT/MDST and IMDCT/IMDST. Then we efficiently implement MDCT/MDST and IMDCT/IMDST of the general length using the regressive structure derived from the sinusoidal recursive formulas. The proposed regular structure is particularly suitable for parallel VLSI realization. Our solution requires significantly less operations as well as less hardware compared with a recently proposed one.

[1]  Graham A. Jullien,et al.  Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length , 1994, IEEE Signal Processing Letters.

[2]  Lap-Pui Chau,et al.  Efficient recursive algorithm for the inverse discrete cosine transform , 2000, IEEE Signal Processing Letters.

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

[4]  Lap-Pui Chau,et al.  Recursive algorithm for the discrete cosine transform with general lengths , 1994 .

[5]  A. Spanias,et al.  Perceptual coding of digital audio , 2000, Proceedings of the IEEE.

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

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

[8]  Hwang-Cheng Chiang,et al.  Regressive implementations for the forward and inverse MDCT in MPEG audio coding , 1996, IEEE Signal Processing Letters.