The Fast Hartley Transform

Proceedings of the IEEE

Volumn 72, Issue 8, 1984, Pages 1010-1018

  Bracewell, Ronald N ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTIONS; DISCRETE HARTLEY TRANSFORM (DHT); FAST ALGORITHMS; FAST HARTLEY TRANSFORM (FHT);

COMPUTER PROGRAMMING - ALGORITHMS; DATA PROCESSING - DIGITAL TECHNIQUES; SPECTRUM ANALYSIS - MATHEMATICAL MODELS;

MATHEMATICAL TRANSFORMATIONS;

EID: 0021470264     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1984.12968     Document Type: Article

References (15)

1. R. N. Bracewell, “The Discrete Hartley Transform,” J. Opt. Soc. Amer., vol. 73, 1832–1835, Dec. 1983.
2. Digital Signal Processing Committee, IEEE ASSP Soc., Eds., Programs for Digital Signal Processing. New York: IEEE PRESS, 1979.
3. T. W. Parson “A Winograd-Fourier transform algorithm for real-valued data,” IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-27, no. 4, pp. 398–402, Aug. 1979.
4. R. N. Bracewell, The Fourier Transform and Its Applications, 2nd ed. New York: McGraw-Hill, 1965, 1978, p. 179.
5. S. Goldman, Frequency Analysis, Modulation and Noise. New York: McGraw-Hill, 1948, pp. 60 and 66.
6. R. V. L. Hartley “A more symmetrical Fourier analysis applied to transmission problems,” Proc. IRE, vol. 30, pp. 144–150, Mar. 1942.
7. F. E. Terman, “Radio Engineers' Handbook. New York: McGraw-Hill, 1943. The oscillator was first described in a patent disclosure dated Feb. 10, 1915.
8. J. W. Cooley and J. W. Tukey “An algorithm for the machine calculation of complex Fourier series,” Math. Comput., vol. 19, pp. 297–301, Apr. 1965.
9. Papers in IEEE Trans. Audio Electroacoust., vol. AU-2, June 1967.
10. G. D. Bergland “A guided tour of the Fast Fourier Transform,” Spectrum, vol. 6, pp. 41–52, July 1969.
11. Digital Signal Processing Committee, IEEE ASSP Soc., Eds., Selected Papers in Digital Signal Processing—II. New York: IEEE 1979.
12. O. Buneman, “Inversion of the Helmholtz (or Laplace-Poisson) operator for slab geometry,” J. Comput. Phys., vol. 12, no. 1, pp. 124–130. May 1973.
13. E. O. Brigham, The Fast Fourier Transform. Englewood Cliffs, NJ: Prentice-Hall, 1974.
14. G. D. Bergland “A fast Fourier algorithm for real-valued series,” Commun. Assoc. Comput. Mach., vol. 11, pp. 703–710, Oct. 1968.
15. O. Buneman, “Two Hartley Transforms for the price of one FFT,” submitted for publication.