The Fast Hartley Transform

H. S. Hou

doi:10.1117/12.966483

19 December 1985 The Fast Hartley Transform

H. S. Hou

Proceedings Volume 0575, Applications of Digital Image Processing VIII; (1985) https://doi.org/10.1117/12.966483
Event: 29th Annual Technical Symposium, 1985, San Diego, United States

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.

Citation Download Citation

H. S. Hou "The Fast Hartley Transform", Proc. SPIE 0575, Applications of Digital Image Processing VIII, (19 December 1985); https://doi.org/10.1117/12.966483

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available