DocumentCode :
1752260
Title :
Computing DFT using approximate fast Hartley transform
Author :
Dee, How Sun ; Jeoti, Varun
Author_Institution :
Sch. of Electr. & Electron. Eng., Univ. of Sci., Malaysia
Volume :
1
fYear :
2001
fDate :
2001
Firstpage :
100
Abstract :
We propose an approximate fast Hartley transform (FHT) based method to compute the discrete Fourier transform (DFT) coefficients approximately. The approximate FHT is implemented using a periodic discrete wavelet transform (DWT). We find that the proposed method is computationally superior to both the radix 2 fast Fourier transform (FFT) and also the radix 2 approximate FFT algorithms
Keywords :
Hartley transforms; approximation theory; discrete Fourier transforms; discrete wavelet transforms; signal processing; DFT; DWT; approximate fast Hartley transform; discrete Fourier transform; fast Fourier transform; periodic discrete wavelet transform; radix 2 FFT; signal approximations; signal processing; Discrete Fourier transforms; Discrete transforms; Discrete wavelet transforms; Equations; Fast Fourier transforms; Postal services; Signal processing algorithms; Sun; Virtual manufacturing; Wavelet transforms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing and its Applications, Sixth International, Symposium on. 2001
Conference_Location :
Kuala Lumpur
Print_ISBN :
0-7803-6703-0
Type :
conf
DOI :
10.1109/ISSPA.2001.949785
Filename :
949785
Link To Document :
بازگشت