By Topic

Implementation of Fast Fourier and Inverse Fast Fourier Transforms in FPGA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ilgaz Az ; Elektronik ve Haberle¿me Mühendisli¿i Bölümü, Kocaeli Üniversitesi, 41040,¿zmit, Kocaeli. e-posta: ehm ; Suhap Sahin ; Mehmet Ali Cavuslu

This article explains implementing of fast Fourier (FFT) and inverse fast Fourier transform (IFFT) algorithms 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 was used the family of Xilinx Virtex2P xc2vp30fg676-7 FPGA device as a hardware in this study. In programming the hardware and writing codes, VHDL was used. The results show that FFT and IFFT algorithms result in 0.6 mus and 0.72 mus cycle time respectively.

Published in:

2007 IEEE 15th Signal Processing and Communications Applications

Date of Conference:

11-13 June 2007