DocumentCode :
3006567
Title :
A fast Fourier transform algorithm using Hadamard transform
Author :
Fan, C.X. ; Wang, S.H.
Author_Institution :
Northwest Telecommunication Engineering Institute, Xi´´an, PR China
Volume :
11
fYear :
1986
fDate :
31503
Firstpage :
225
Lastpage :
228
Abstract :
A fast Fourier transform (FT) algorithm using Hadamard transform (HT) is introduced, which is called HFT (Hadamard Fourier Transform). In the algorithm proposed here, a HT is used as mid-transform and the redundant calculation in the original fast FT algorithm is reduced by double transformation. The results of theoretical analysis show that the number of multiplications and additions of HFT are both decreased by 60% compared with that of traditional FFT and the executed result shows the computing speed of HFT is 1.6 to 1.7 times faster than FFT. Comparing with the similar algorithms such as WFT-II1, RFT2, it has a market improvement in computing speed and eliminates the limitatiom on the length of transform.
Keywords :
Application software; Computational complexity; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Frequency domain analysis; Hardware; Signal processing algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '86.
Type :
conf
DOI :
10.1109/ICASSP.1986.1169074
Filename :
1169074
Link To Document :
بازگشت