Fast fourier transforms: a tutorial review and a state of the art
Signal Processing
Signal Processing with Lapped Transforms
Signal Processing with Lapped Transforms
A Tutorial on MPEG/Audio Compression
IEEE MultiMedia
A fast algorithm for the computation of 2-D forward and inverse MDCT
Signal Processing
Fast IMDCT and MDCT algorithms - a matrix approach
IEEE Transactions on Signal Processing
A Modified Split-Radix FFT With Fewer Arithmetic Operations
IEEE Transactions on Signal Processing
DCT algorithms for composite sequence lengths
IEEE Transactions on Signal Processing
Fast algorithm for computing discrete cosine transform
IEEE Transactions on Signal Processing
Computation of forward and inverse MDCT using Clenshaw's recurrence formula
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computationally intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficiently computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation-in-frequency algorithm, is obtained by decomposing an N-point MDCT into two MDCTs with the length N/2. The second algorithm, called the radix-3 decimation-in-time algorithm, is obtained by decomposing an N-point MDCT into three MDCTs with the length N/3. Since the proposed MDCT algorithm is also expressed in the form of a simple sparse matrix factorization, the corresponding IMDCT algorithm can be easily derived by simply transposing the matrix factorization. Comparison of the proposed algorithm with some existing ones shows that our proposed algorithm is more suitable for parallel implementation and particularly suitable for the layer III of MPEG-1 and MPEG-2 audio encoding and decoding. Moreover, the proposed algorithm can be easily extended to the multidimensional case by using the vector-radix method.