Title :
Fast two-dimensional Hartley transform
Author :
Bracewell, R.N. ; Buneman, O. ; Hao, H. ; Villasenor, J.
Author_Institution :
Stanford University, Stanford, CA, USA
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 :
Arithmetic; Content addressable storage; Digital images; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Image processing; Kernel; Space technology; Spectral analysis;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1986.13619