Comparison of algorithms for computing the two-dimensional discrete hartley transform

Stephen E. Reichenbach, John C. Burton, Keith W. Miller

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Three methods have been described for computing the two-dimensional, discrete Hartley transform. Two of these employ a separable transform; the third method, the vector-radix algorithm, does not require separability. In-place computation of the vector-radix method is described. Operation counts and execution times indicate that the vector-radix method is fastest.

Original languageEnglish (US)
Pages (from-to)818-822
Number of pages5
JournalJournal of the Optical Society of America A: Optics and Image Science, and Vision
Issue number6
StatePublished - Jun 1989
Externally publishedYes

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Atomic and Molecular Physics, and Optics
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Comparison of algorithms for computing the two-dimensional discrete hartley transform'. Together they form a unique fingerprint.

Cite this