21-08-2014, 10:40 AM
The project is based on “Implementation of FFT using VHDL”. In this project first FFT and VHDL were studied apiece first. Then the implementation of FFT algorithms using VHDL was done in a modular way. The modules made for implementing four and eight point FFT are adders (8-bit and 16-bit), butterfly and main FFT one. The architecture in the programs broadly uses structural and dataflow modeling. The aforementioned task was done using Xilinx ISE 10.1 and ModelSim simulator.
A Fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this project report gives an overview of the available techniques and some of their general properties, and its programming in VHDL. Many applications like spectral analysis, filtering, convolution, correlation, interpolation, involve FFT. In this project the implementation of FFT algorithm has been done using VHDL codes.
VHDL (VHSIC (Very High Speed Integrated Circuits) hardware description language) is commonly used as a design-entry language for field-programmable gate arrays and application-specific integrated circuits in electronic design automation of digital circuits. Because of this general-purpose nature, it is possible to use VHDL to write a testbench that verifies the functionality of the design using files on the host computer to define stimuli, interacts with the user, and compares results with those expected. VHDL is a strongly typed language. To implement these codes the synthesizer used is XILINX ISE 10.1 software and simulator used is MODELSIM.
By using VHDL basic blocks like Multiplexer, 8-bit/16-bit adder etc. were also coded and simulated successfully.