By Topic

A High Speed FPGA Implementation of a 1024-Point Complex FFT Processor

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)
Zahra Haddad Derafshi ; Microelectron. & Microsensor Lab., Tabriz Univ., Tabriz, Iran ; Javad Frounchi ; Hamed Taghipour

In this paper a hardware implementation of a Fast Fourier Transform (FFT) processor has been presented. Described FFT processor is implemented on a virtex-4 LX25 FPGA from Xilinx. The designed processor is a fixed-point processor which calculates a 1024-point complex FFT using radix-2 butterfly computation method with less than 1% error. This system completes the process in 26μs at operating frequency of 100MHz. The number of occupied slices on the (FPGA) is 2472 which covers 23% of the whole chip.

Published in:

Computer and Network Technology (ICCNT), 2010 Second International Conference on

Date of Conference:

23-25 April 2010