Computation of forward and inverse MDCT using Clenshawʹs recurrence formula

The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for parallel VLSI realization. Our solution requires less hardware, and we achieved significant savings for a number of operations compared with existing related systems.