DocumentCode
1193749
Title
Transforming real-valued sequences: fast Fourier versus fast Hartley transform algorithms
Author
Uniyal, P.R.
Author_Institution
Nat. Geophys. Res. Inst., Hyderabad, India
Volume
42
Issue
11
fYear
1994
fDate
11/1/1994 12:00:00 AM
Firstpage
3249
Lastpage
3254
Abstract
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
Keywords
Hartley transforms; discrete Fourier transforms; fast Fourier transforms; floating point arithmetic; sequences; signal processing; Bruun algorithm; DFT; FHT; fast Fourier transform algorithms; fast Hartley transform algorithms; real-valued FFT; real-valued data; real-valued sequences; signal processing; Algorithm design and analysis; Arithmetic; Computer applications; Computer architecture; Data analysis; Discrete Fourier transforms; Fast Fourier transforms; Hardware; Signal processing algorithms; Timing;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.330387
Filename
330387
Link To Document