Fast algorithms for computing the discrete cosine transform

Efficient methods for mapping odd-length type-II, type-II, and type-IV DCTS to a real-valued DFT are presented. It is found that odd-length type-II and type-III DCTs can be transformed, by means of an index mapping, to a real-valued DFT of the same length using permutations and sign changes only. The real-valued DFT can then be computed by efficient real-valued FFT algorithms such as the prime factor algorithm. Similar mapping is introduced to convert a type-IV DCT to a real-valued DFT up to a scaling factor and some additions. Methods for computing DCTs with even lengths are also discussed. >

[1]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[2]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[3]  J. Makhoul.  A fast cosine transform in one and two dimensions , 1980 .

[4]  P. Yip,et al.  Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms , 1984 .

[5]  Zhongde Wang.  Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[6]  C. Sidney Burrus,et al.  Prime factor FFT algorithms for real-valued series , 1984, ICASSP.

[7]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[8]  Okan K. Ersoy,et al.  Real discrete Fourier transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[9]  P. Yang,et al.  Prime factor decomposition of the discrete cosine transform and its hardware realization , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  Pierre Duhamel,et al.  Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data , 1986, IEEE Trans. Acoust. Speech Signal Process..

[11]  M. Chelemal-D,et al.  FAST COMPUTATIONAL ALGORITHMS FOR THE DISCRETE COSINE TRANSFORM , 1986 .

[12]  C S. Burrus.  Efficient Fourier transform and convolution algorithms , 1987 .

[13]  O. K. Ersoy,et al.  A unified approach to the fast computation of all discrete trigonometric transforms , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[15]  C. H. Chen,et al.  Transform-coding of images with reduced complexity , 1988, Comput. Vis. Graph. Image Process..

[16]  P. Yip,et al.  The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms , 1988 .

[17]  Byeong Gi Lee.  Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform , 1989, IEEE Trans. Acoust. Speech Signal Process..

[18]  Martin Vetterli,et al.  Trade-off's in the computation of mono- and multi-dimensional DCT's , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[19]  O. K. Ersoy,et al.  Fast computation of real discrete Fourier transform for any number of data points , 1991 .

[20]  Shing-chow. Chan,et al.  Fast transform algorithms and their applications , 1991 .