The Community for Technology Leaders
Green Image
Issue No. 08 - August (1983 vol. 32)
ISSN: 0018-9340
pp: 750-754
G. Bongiovanni , Istituto Matematico "G. Castelnuovo," University of Rome
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.
VLSI, Area-time complexity, computational complexity, data rate, Fourier transformation, pipeline structures, shuffle-exchange connections
G. Bongiovanni, "Two VLSI Structures for the Discrete Fourier Transform", IEEE Transactions on Computers, vol. 32, no. , pp. 750-754, August 1983, doi:10.1109/TC.1983.1676314
98 ms
(Ver 3.3 (11022016))