Share Email Print

Proceedings Paper

VLSI Implementation Of The Fast Fourier Transform
Author(s): Paul M. Chau; Walter H. Ku
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A VLSI implementation of a Fast Fourier Transform (FFT) processor consisting of a mesh interconnection of complex floating-point butterfly units is presented. The Cooley-Tukey radix-2 Decimation-In-Frequency (DIF) formulation of the FFT was chosen since it offered the best overall compromise between the need for fast and efficient algorithmic computation and the need for a structure amenable to VLSI layout. Thus the VLSI implementation is modular, regular, expandable to various problem sizes and has a simple systolic flow of data and control. To evaluate the FFT architecture, VLSI area-time complexity concepts are used, but are now adapted to a complex floating-point number system rather than the usual integer ring representation. We show by our construction that the Thompson area-time optimum bound for the VLSI computation of an N-point FFT, area-time2oc = ORNlogN)1+a] can be attained by an alternative number representation, and hence the theoretical bound is a tight bound regardless of number system representation.

Paper Details

Date Published: 23 March 1986
PDF: 17 pages
Proc. SPIE 0698, Real-Time Signal Processing IX, (23 March 1986); doi: 10.1117/12.976248
Show Author Affiliations
Paul M. Chau, Cornell University (United States)
Walter H. Ku, Cornell University (United States)

Published in SPIE Proceedings Vol. 0698:
Real-Time Signal Processing IX
William J. Miceli, Editor(s)

© SPIE. Terms of Use
Back to Top