A comparison of the time involved in computing fast Hartley and fast Fourier transforms
- 1 January 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 73 (12) , 1863-1864
- https://doi.org/10.1109/proc.1985.13381
Abstract
It is shown that the DFT of a real sequence, formed via the Fast Hartley Transform, can be computed at most only 2 times faster than by using a complex Fast Fourier Transform. However, more sophisticated FFT algorithms exist which give the same speedup factor. A simple FHT subroutine is presented to illustrate the similarity of the FHT and FFT butterflies in their simplest forms.Keywords
This publication has 5 references indexed in Scilit:
- Comments on "The fast Hartley transform"Proceedings of the IEEE, 1985
- The fast Hartley transformProceedings of the IEEE, 1984
- Discrete Hartley transformJournal of the Optical Society of America, 1983
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- A More Symmetrical Fourier Analysis Applied to Transmission ProblemsProceedings of the IRE, 1942