Title :
Two VLSI Structures for the Discrete Fourier Transform
Author_Institution :
Istituto Matematico "G. Castelnuovo," University of Rome
Abstract :
Two VLSI structures for the computation of the discrete Fourier transform are presented. The first structure is a pipeline working concurrently on different transforms. It is shown that it matches, within a constant factor, the theoretical lower bounds for area versus data rate. The second structure is a simple modification of the first one; it works on a single transform at a time, and it matches within a constant factor the theoretical area-time lower bounds.
Keywords :
Area-time complexity; Fourier transformation; VLSI; computational complexity; data rate; pipeline structures; shuffle-exchange connections; Computational complexity; Costs; Discrete Fourier transforms; Discrete transforms; Performance evaluation; Pipelines; Silicon; Sorting; Very large scale integration; Wire; Area-time complexity; Fourier transformation; VLSI; computational complexity; data rate; pipeline structures; shuffle-exchange connections;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1983.1676314
