论文信息 - Fast computation of the discrete cosine transform and the discrete Hartley transform

Fast computation of the discrete cosine transform and the discrete Hartley transform

A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the discrete cosine transform (DCT) with reduced number of multiplications.

Henrique S. Malvar

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

[2] Douglas L. Jones,et al. On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[3] H. S. Hou. The Fast Hartley Transform , 1985, Optics & Photonics.

[4] D. Lipka,et al. Fast Hartley transform algorithm , 1985 .

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

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

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

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

[9] Hsieh S. Hou,et al. The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.

[10] Henrique S. Malvar. Fast computation of discrete cosine transform through fast Hartley transform , 1986 .

[11] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.

[12] R. R. Clarke. Transform coding of images , 1985 .