The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1987 vol.36)
pp: 147-156
H.S. Hou , Electronics and Optics Division, The Aerospace Corporation
ABSTRACT
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order FHT's. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow-graphs indicates an ease of implementation in VLSI.
INDEX TERMS
recursive algorithm, Discrete cosine transform, discrete Hartley transform, fast Hartley transform, fast Fourier transform, generalized Cooley-Tukey FFT, parallel processing
CITATION
H.S. Hou, "The Fast Hartley Transform Algorithm", IEEE Transactions on Computers, vol.36, no. 2, pp. 147-156, February 1987, doi:10.1109/TC.1987.1676877
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool