EFFICIENT IMPLEMENTATION OF FFT PROCESSOR
2014
Integrated circuits to support digital communication standards are commonly based on a Fast Fourier Transform (FFT) of some length. Flexible length makes the design more usable for configurable algorithm-specific circuits. The proposed project discusses the functional aspects o f a FFT design. As the transform length increases the amount of arithmetic involved becomes excessive. This makes Fast Fourier Transform (FFT) to one of today’s most important tools in digital signal processing, as it enables the efficient transformation between time and frequency domain. Over the last decade, researches have been done on how to transmit the data using OFDM transmission over selective channels. The proposed project will show how the FFT is better adapted to the requirements in the application of OFDM . The simulation results show the output of each butterfly by enabling co-simulation of the butterfly outputs using VHDL. The simulation results also show the transmission of data through OFDM technique using FFT implementation. The Synthesizing and implementation (i.e. Translate, Map and Place and Route) of the code is carried out on Xilinx - Project Navigator, ISE 8.2i suite.
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
4
References
0
Citations
NaN
KQI