Ilgaz Az, Suhap Şahin, Cihan Karakuzu, Mehmet Ali Çavuşlu
ISEECE 2006 3rd International Symposium on Electrical, Electronic and Computer Engineering Symposium Proceedings, Nicosia, TRNC, Pages. 7 – 10 ,2006
Abstract: This article explains implementing of Fast Fourier (FFT) and Inverse Fast Fourier Transform algorithms(IFFT) in FPGA. The reason of designing the study on FPGA base is that FPGAs are able to rearrange of logical blocks and moreover, mathematical algorithms can confirm faster by means of parallel data processing. For operating these algorithms, it is used the family of Xilinx Virtex2P xc2vp30fg676-7 FPGA device as a hardware. In programming the hardware and writing codes, VHDL is used. The results show that FFT and IFFT algorithms result in 0.6 μs and 0.72 μs cycle time respectively.
