Fast two-dimensional Hartley transform
- 1 January 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 74 (9), 1282-1283
- https://doi.org/10.1109/proc.1986.13619
Abstract
The fast Hartley transform algorithm introduced in 1984 offers an alternative to the fast Fourier transform, with the advantages of not requiring complex arithmetic or a sign change of i to distinguish inverse transformation from direct. A two-dimensional extension is described that speeds up Fourier transformation of real digital images.Keywords
This publication has 6 references indexed in Scilit:
- Conversion of FFT’s to Fast Hartley TransformsSIAM Journal on Scientific and Statistical Computing, 1986
- Fast Hartley transform algorithmElectronics Letters, 1985
- A comparison of the time involved in computing fast Hartley and fast Fourier transformsProceedings of the IEEE, 1985
- Comments on "The fast Hartley transform"Proceedings of the IEEE, 1985
- The fast Hartley transformProceedings of the IEEE, 1984
- A More Symmetrical Fourier Analysis Applied to Transmission ProblemsProceedings of the IRE, 1942