DocumentCode
705468
Title
Streamlined real-factor FFTs
Author
Khan, Mohammed Zafar Ali ; Qadeer, Shaik
Author_Institution
ICSL IIT, Hyderabad, India
fYear
2010
fDate
23-27 Aug. 2010
Firstpage
567
Lastpage
571
Abstract
In this paper we show that Rader and Brenner´s `real-factor´ FFT can be streamlined so that it requires lower computational complexity as compared to the Cooley- Tukey radix-2 FFT. We then show that the fixed point implementation of `real-factor´ FFT can be modified so that its noise-to-signal ratio (NSR) is lower than the NSR of Cooley-Tukey radix-2 FFT. Finally simulation results are presented which verify the suitability of `real-factor´ FFTs.
Keywords
computational complexity; discrete Fourier transforms; fixed point arithmetic; software radio; Brenner real-factor FFT; Cooley-Tukey radix-2 FFT; Rader real-factor FFT; computational complexity; discrete Fourier transform; fixed point implementation; noise-to-signal ratio; streamlined real-factor FFT; Complexity theory; Discrete Fourier transforms; Fast Fourier transforms; Noise; Signal processing algorithms; Simulation; DFT; FFT; real-factor FFT;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2010 18th European
Conference_Location
Aalborg
ISSN
2219-5491
Type
conf
Filename
7096741
Link To Document