The fast Hartley transform
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 72 (8) , 1010-1018
- https://doi.org/10.1109/proc.1984.12968
Abstract
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a time proportional to Nlog2N. The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied. A new timing diagram (stripe diagram) is presented to illustrate the overall dependence of running time on the subroutines composing one implementation; this mode of presentation supplements the simple counting of multiplies and adds. One may view the Fast Hartley procedure as a sequence of matrix operations on the data and thus as constituting a new factorization of the DFT matrix operator; this factorization is presented. The FHT computes convolutions and power spectra distinctly faster than the FFT.Keywords
This publication has 7 references indexed in Scilit:
- Discrete Hartley transformJournal of the Optical Society of America, 1983
- A winograd-Fourier transform algorithm for real-valued dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Inversion of the Helmholtz (or Laplace-Poisson) operator for slab geometryJournal of Computational Physics, 1973
- A guided tour of the fast Fourier transformIEEE Spectrum, 1969
- Numerical Analysis: A fast fourier transform algorithm for real-valued seriesCommunications of the ACM, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- A More Symmetrical Fourier Analysis Applied to Transmission ProblemsProceedings of the IRE, 1942