DocumentCode :
1606500
Title :
An improved radix-16 FFT algorithm
Author :
Bouguezel, Saad ; Ahmad, M. Omair ; Swamy, M.N.S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume :
2
fYear :
2004
Firstpage :
1089
Abstract :
An improved radix-16 decimation-in-frequency (DIF) FFT algorithm is proposed by introducing new indices for some of the output sub-sequences resulting from the conventional radix-16 DIF decomposition of the DFT. This improved radix-16 DIF FFT algorithm achieves savings of more than 46% in the number of twiddle factor evaluations or accesses to the lookup table and address generations compared to the conventional radix-16 DIF FFT algorithm. These savings are achieved without imposing any additional computational or structural complexity in the algorithm.
Keywords :
computational complexity; digital arithmetic; discrete Fourier transforms; fast Fourier transforms; DFT; address generation; algorithm structural complexity; computational complexity; decimation-in-frequency FFT algorithm; lookup table accesses; radix-16 FFT algorithm; twiddle factor evaluations; Arithmetic; Discrete Fourier transforms; Fast Fourier transforms; Frequency; Portable computers; Radar applications; Table lookup; Very large scale integration; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering, 2004. Canadian Conference on
ISSN :
0840-7789
Print_ISBN :
0-7803-8253-6
Type :
conf
DOI :
10.1109/CCECE.2004.1345308
Filename :
1345308
Link To Document :
بازگشت