Close category search window
 

Implementation of an ultra-high speed 256-point FFT for Xilinx Virtex-6 devices

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

8 Author(s)
Dreschmann, M. ; Inst. of Inf. Process. Technol., Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany ; Meyer, J. ; Hubner, M. ; Schmogrow, R.
more authors

In this paper we present a parallel, FPGA-based implementation of a 256-point Fast Fourier Transform capable to perform over 78 million transformations per second. Its area of operation is located in the ultra-high speed OFDM communication in optical networks where the FFT algorithm provides the basis of the digital signal processing. The main focus lies on an implementation using as less as possible resources while ensuring the required high performance. However, to allow an adaptation of the core to different applications, a flexible adaptivity of internal bit vector widths was realized.

Published in:
Industrial Informatics (INDIN), 2011 9th IEEE International Conference on

Date of Conference: 26-29 July 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.