By Topic

A modular pipelined implementation of large fast Fourier transforms

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

2 Author(s)
El-Khashab, A.M. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA ; Swartzlander, E.E., Jr.

This paper presents a modular pipeline architecture for computing long discrete Fourier transforms (DFT). For an N point DFT, two conventional pipeline /spl radic/N point fast Fourier transform (FFT) modules are joined by a specialized center element. The center element contains memories, multipliers and control logic. Compared with a standard N point pipeline FFT the modular FFT reduces the number of delay elements required. Further, the coefficient storage is concentrated within the center element, reducing the storage requirement in the pipeline FFT modules. The centralized memory and address generator provide the storage and data reordering. The throughput of a standard radix-2 pipeline FFT is maintained with slightly higher end-to-end latency. A simulator has been built to analyze the proposed architecture. Results for DFTs of lengths up to 4M points are presented and compared with alternate algorithms.

Published in:

Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on  (Volume:2 )

Date of Conference:

3-6 Nov. 2002