A fast algorithm for the computation of 2-D forward and inverse MDCT

  • Authors:

  • J. S. Wu;H. Z. Shu;L. Senhadji;L. M. Luo

  • Affiliations:

  • Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, 210096 Nanjing, China and Centre de Recherche en Information Biomédicale Sino-Fra ...;Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, 210096 Nanjing, China and Centre de Recherche en Information Biomédicale Sino-Fra ...;INSERM, U642, Rennes F-35000, France and Université de Rennes 1, LTSI, Rennes F-35000, France and Centre de Recherche en Information Biomédicale Sino-Français (CRIBs), France;Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, 210096 Nanjing, China and Centre de Recherche en Information Biomédicale Sino-Fra ...

  • Venue:
  • Signal Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.09

Visualization

Abstract

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 MxN into four 2-D discrete cosine transforms (DCTs) with block size (M/4)x(N/4). It is based on an algorithm recently presented by Cho et al. [An optimized algorithm for computing the modified discrete cosine transform and its inverse transform, in: Proceedings of the IEEE TENCON, vol. A, 21-24 November 2004, pp. 626-628] 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.