Academic Journals Database
Disseminating quality controlled scientific knowledge

Implementation of FFT by using MATLAB: SIMULINK on Xilinx Virtex - 4 FPGAs: Performance of a Paired Transform Based FFT

ADD TO MY LIST
 
Author(s): Ranganadh Narayanam | Artyom M. Grigoryan | Bindu Tushara D

Journal: International Journal of Advanced Computer Research
ISSN 2249-7277

Volume: 3;
Issue: 10;
Start page: 72;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Frequency analysis | fast algorithms | DFT | FFT | paired transforms

ABSTRACT
Discrete Fourier Transform is principalmathematical method for the frequency analysisand is having wide applications in Engineering andSciences. Because the DFT is so ubiquitous, fastmethods for computing DFT have been studiedextensively, and continuous to be an activeresearch.The way of splitting the DFT gives outvarious fast algorithms.In this paper, we presentthe implementation of two fast algorithms for theDFT for evaluating their performance.One of themis the popular radix-2Cooley-Tukey fast Fouriertransform algorithm (FFT) [1] and the other one isthe Grigoryan FFT based on the splitting by thepaired transform [2].We evaluate the performanceof these algorithms by implementing them on theXilinx Virtex-4 FPGAs [3], by developing our ownFFT processor architectures.Finally we show thatthe Grigoryan FFT is working faster than Cooley-Tukey FFT, consequently it is useful for highersampling rates. Operating at higher sampling ratesis a challenge in DSP applications.
Affiliate Program      Why do you need a reservation system?