论文信息 - Fast computation of discrete cosine transform through fast Hartley transform

Fast computation of discrete cosine transform through fast Hartley transform

A relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT.

Henrique S. Malvar

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

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

[3] R. Bracewell. Discrete Hartley transform , 1983 .

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

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

[6] Peter No,et al. Digital Coding of Waveforms , 1986 .

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