论文信息 - Recursive algorithms for discrete cosine transform

Recursive algorithms for discrete cosine transform

The discrete cosine transform (DCT) is one of the most widely used transforms in digital signal processing. A recursive algorithm with a regular structure is first presented for computing the discrete cosine transform (DCT-II), it requires no data shifts, the multiplication coefficients can be generated by a simple recursion. Then the recursive algorithms for DCT-I and DCT-IV are presented. These algorithms have a better stability, with a complexity which is the same as that of Lee (1984) and Wang (1985), making them very useful in practice.

Zhao Zhijin | Qian Huisheng

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

[2] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

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

[4] Graham A. Jullien,et al. Recursive algorithm for discrete sine transform with regular structure , 1994 .

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

[6] Zoran Cvetkovic,et al. New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..

[7] ZHONGDE WANG. On computing the discrete Fourier and cosine transforms , 1985, IEEE Trans. Acoust. Speech Signal Process..