• Dec 26, 2017 News!Vol. 4, No. 1-No.3 has been indexed by EI (Inspec).   [Click]
  • Dec 26, 2017 News!Vol. 3, No. 4 has been indexed by EI (Inspec).   [Click]
  • Dec 25, 2017 News!Welcome to 2018 7th International Conference on Software and Computing Technologies (ICSCT 2018), which will be held in Kuala Lumpur during April 7-9, 2018.   [Click]
General Information
    • ISSN: 2301-3559
    • Frequency: Quarterly
    • DOI: 10.18178/LNSE
    • Editor-in-Chief: Prof. Jemal Antidze
    • Executive Editor: Ms. Nina Lee
    • Abstracting/ Indexing: EI (INSPEC, IET), Electronic Journals Library,  Ulrich's Periodicals Directory, International Computer Science Digital Library (ICSDL), ProQuest and Google Scholar.
    • E-mail: lnse@ejournal.net
Prof. Jemal Antidze
I. Vekua Scientific Institute of Applied Mathematics
Tbilisi State University, Georgia
I'm happy to take on the position of editor in chief of LNSE. We encourage authors to submit papers concerning any branch of Software Engineering.

LNSE 2014 Vol.2(3): 247-250 ISSN: 2301-3559
DOI: 10.7763/LNSE.2014.V2.131

Programmable N-Point FFT Design

Ramesh Bhakthavatchalu, Meera Viswanath, Pallavi Venugopal M., and Anju R.
Abstract—The FFT, Fast Fourier Transform is the most ubiquitous algorithm used for signal analysis in present-day communication systems (Example: OFDM). The general principle of FFT Algorithms is to use a Divide and Conquer approach that effectively reduces operation count. The FFT is generally computed either using a single radix or by mixed radix algorithms. Several optimization techniques have been proposed to increase efficiency while computing the Fourier Transform. This paper develops a reconfigurable FFT processor that can take any number of points as input, and is not limited to sequence lengths that are powers of the radix. The paper compares the factorized mixed radix approach with the single radix approach for computation of the FFT of a truly N-point sequence and shows that the mixed-radix approach yields better performance results. The test designs were developed in VHDL, verified in Matlab and Modelsim, and implemented using Xilinx Virtex5 LX110T FPGA.

Index Terms—Fast fourier transform, mixed radix, cooley-Tukey algorithm, prime-factor algorithm, word length effects.

The authors are with Department of Electronics and Communication Engineering Amrita Vishwa Vidyapeetham, India (e-mail: ramesh.amrita@gmail.com).


Cite: Ramesh Bhakthavatchalu, Meera Viswanath, Pallavi Venugopal M., and Anju R., "Programmable N-Point FFT Design," Lecture Notes on Software Engineering vol. 2, no. 3, pp. 247-250, 2014.

Copyright © 2008-2015. Lecture Notes on Software Engineering. All rights reserved.
E-mail: lnse@ejournal.net