By Topic

Transforming real-valued sequences: fast Fourier versus fast Hartley transform algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. R. Uniyal ; Nat. Geophys. Res. Inst., Hyderabad, India

Five programs for efficient computation of DFT of real-valued data are analyzed with respect to their operation counts vis-a-vis run times on weak and powerful floating-point processors. The results help dispose of the claims of superiority of FHT over corresponding real-valued FFT. The Bruun (1978) algorithm turns out to be a “best” performer

Published in:

IEEE Transactions on Signal Processing  (Volume:42 ,  Issue: 11 )