zbMATH — the first resource for mathematics

A fast algorithm for the computation of 2-D forward and inverse MDCT. (English) Zbl 1186.94016
Summary: A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size \(M\times N\) into four 2-D discrete cosine transforms (DCTs) with block size \((M/4)\times (N/4)\). It is based on an algorithm recently presented by Y. K. Cho, T. H. Song, H.S. Kim, An optimized algorithm for computing the modified discrete cosine transform and its inverse transform, in: Proceedings of the IEEE TENCON, 21–24, 626–628 (2004)] for the efficient calculation of one-dimensional MDCT and IMDCT. Comparison of the computational complexity with the traditional row-column method shows that the proposed algorithm reduces significantly the number of arithmetic operations.

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
65T50 Numerical methods for discrete and fast Fourier transforms
PDF BibTeX Cite
Full Text: DOI