The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1983 vol.32)
pp: 750-754
G. Bongiovanni , 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.
INDEX TERMS
VLSI, Area-time complexity, computational complexity, data rate, Fourier transformation, pipeline structures, shuffle-exchange connections
CITATION
G. Bongiovanni, "Two VLSI Structures for the Discrete Fourier Transform", IEEE Transactions on Computers, vol.32, no. 8, pp. 750-754, August 1983, doi:10.1109/TC.1983.1676314
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool