By Topic

The implementation of high-speed FFT processor based on 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
$31 $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)
Xiao-Feng Li ; Dept. of Electromech. Eng., Beijing Inst. of Technol., Beijing, China ; Chen Long ; Wang Shihu

A method of implementing 256-point, high-speed and 16-bit complex FFT is presented on the radix-4 FFT algorithm. By using a fixed geometry addressing, pipeline designing and block floating point structure, the data has the greater precision and dynamic range. The results show that the design is efficient, strongly extensive and occupies less resource. It is a good method to meet the high-speed digital signal processing requirements.

Published in:

Computer, Mechatronics, Control and Electronic Engineering (CMCE), 2010 International Conference on  (Volume:2 )

Date of Conference:

24-26 Aug. 2010