The Discrete Fourier Transform (DFT) is used to transform the samples in time domain into frequency domain coefficients. The Fast Fourier Transform (FFT) is a widely used algorithm that computes the Discrete Fourier Transform (DFT) using much less operations than a direct realization of the DFT. FFTs is of great significance to a wide variety of applications such as data compression, spectral analysis etc. This paper proposes a design that implements a Fast Fourier transform (FFT). The module is developing by Radix- 2, Radix-4 decimation in time algorithm structure. The operation of the FFT processor performs three main processes i.e. data load, compute and result unload. The processing cycle starts with the data load process. In this process sampled data is read in and stored in memory. During the compute process computation of FFT on the stored data is performed and result unloaded process makes the FFT results available at its output. This paper also compares the performance of Radix-2 algorithm with Radix-4 algorithm.
[1]
G SudhaKiran,et al.
FPGA Implementation of 256-Bit, 64-Point DIT-FFT Using Radix-4 Algorithm
,
2013
.
[2]
Xiaojin Li,et al.
A Low Power and Small Area FFT Processor for OFDM Demodulator
,
2007,
IEEE Transactions on Consumer Electronics.
[3]
G. D. Bergland,et al.
A guided tour of the fast Fourier transform
,
1969,
IEEE Spectrum.
[4]
Sneha N. kherde,et al.
Efficient Design and Implementation of FFT
,
2010
.
[5]
M. Eladawy,et al.
Efficient FPGA implementation of FFT/IFFT Processor
,
2009
.
[6]
A. Haveliya.
Design and Simulation of 32-Point FFT Using Radix-2 Algorithm for FPGA Implementation
,
2012,
2012 Second International Conference on Advanced Computing & Communication Technologies.
[7]
Ramesh Kumar.B,et al.
Design and Simulation of 64-Point FFT Using Radix-4 Algorithm
,
2013
.