论文信息 - A new algorithm to compute the discrete cosine Transform - 字舞流文

A new algorithm to compute the discrete cosine Transform

A new algorithm is introduced for the 2m-point discrete cosine transform. This algorithm reduces the number of multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler.

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

[2] Haralick. A Storage Efficient Way to Implement the Discrete Cosine Transform , 1976, IEEE Transactions on Computers.

[3] Robert M. Harlick. A Storage Efficient Way to Implement the Discrete Cosine Transform , 1976, IEEE Trans. Computers.

[4] N. Bose. Implementation of a new stability test for two-dimensional filters , 1977 .

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

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

[7] William C. Miller,et al. On Computing the Discrete Cosine Transform , 1978, IEEE Transactions on Computers.

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

[9] Jae Lee. On the interrelationships among a class of convolutions , 1984 .