论文信息 - Polynomial transform computation of the 2-D DCT

Polynomial transform computation of the 2-D DCT

A 2-D DCT (discrete cosine transform) algorithm based on a direct polynomial approach is presented. The resulting algorithm reduces the number of both multiplications and additions compared to previous algorithms. It is shown that, although being mathematically involved, it possesses a clean, butterfly-based structure. Tables comparing the number of operations are provided, as well as flowgraphs.<<ETX>>

Pierre Duhamel | Christine Guillemot | P. Duhamel | C. Guillemot

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

[2] H. Nussbaumer,et al. Fast computation of discrete Fourier transforms using polynomial transforms , 1979 .

[3] Martin Vetterli,et al. Fast 2-D discrete cosine transform , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4] M. Vetterli,et al. Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[5] 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,.

[6] Discrete Cosine Transform Basics 1 Discrete Cosine Transform Basics , .

[7] Pierre Duhamel,et al. Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms , 1990, IEEE Trans. Acoust. Speech Signal Process..