By Topic

The modular pipeline fast Fourier transform algorithm and architecture

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

2 Author(s)
A. M. El-Khashab ; nLine Corp., Austin, TX, USA ; E. E. Swartzlander

This paper examines the modular pipeline fast Fourier transform algorithm and architecture. This algorithm couples a pair of √N-point FFT units with a center element to facilitate the efficient computation of N-point FFTs. The fundamental algorithm as well as an example pipeline FFT architecture are presented. Modular pipeline implementations substantially reduce the total number of delay elements. As a result, in a system where dynamic power is a concern, a reduction in total power consumption is achieved. The center element contains coefficient and data memory as well as addressing, routing, and control logic. This architecture encourages reusability in the FFT modules and provides equivalent throughput to conventional pipeline FFT architectures.

Published in:

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

Date of Conference:

9-12 Nov. 2003