Share Email Print

Proceedings Paper

The Fast Hartley Transform
Author(s): H. S. Hou
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The Fast Hartley Transform (FHT) is similar to the Cooley-Tukey Fast Fourier Transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, Discrete Cosine Transforms (DOT) and Discrete Fourier Transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher-order FHT from two identical lower-order FHTs. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow graphs indicates an ease of implementation in VSLI.

Paper Details

Date Published: 19 December 1985
PDF: 9 pages
Proc. SPIE 0575, Applications of Digital Image Processing VIII, (19 December 1985); doi: 10.1117/12.966483
Show Author Affiliations
H. S. Hou, The Aerospace Corporation (United States)

Published in SPIE Proceedings Vol. 0575:
Applications of Digital Image Processing VIII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?