On the design of VLSI circuits for the Winograd Fourier transform algorithm
Abstract
A VLSI architecture for computing the discrete Fourier transform (DFT) using the Winograd Fourier transform algorithm (WFTA) is presented. This architecture is an addressless, routed, bitserial scheme that directly maps an Npoint algorithm onto silicon. The architecture appears to be far less costly than systolic schemes for implementing the WFTA, and faster than current FFT devices for similar transform sizes. The nesting method of Winograd is used for partitioning larger transformations into several circuits. The advantage of this partitioning technique is that it allows using circuits that are all of the same type. However, the number of input/output pins of each circuit is higher than with some other approaches like, for example, the prime factor algorithm. The design of a 20point DFT circuit with logic diagrams of its major cells is presented. The gate array circuit has been sent for fabrication in a 0.7 micron CMOS technology. Five circuits interconnected together will compute 60point complex transforms at a rate of one transformation every 0.53 micron.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 December 1991
 Bibcode:
 1991STIN...9226244L
 Keywords:

 Algorithms;
 Fourier Transformation;
 Very Large Scale Integration;
 Arrays;
 Discrete Functions;
 Gates (Circuits);
 Input/Output Routines;
 Rates (Per Time);
 Silicon;
 Electronics and Electrical Engineering