The Community for Technology Leaders
Green Image
Issue No. 08 - August (1983 vol. 32)
ISSN: 0018-9340
pp: 756-760
G. Bongiovanni , Istituto Matematico G. Castelnuovo, Universit? di Roma, Citt? Universitaria
A network for the evaluation of the fast Fourier transform (FFT) is presented. Such a network is able to compute, in parallel, the FFT's of arbitrary partitions in powers of two of the N input elements. It is shown that, under a VLSI model of computations, such a design requires the same asymptotical area and attains the same throughput as the corresponding network for the evaluation of a single N-element FFT.
VLSI, Area-time complexity, Fourier transformation, shuffle-exchange connections
G. Bongiovanni, "A VLSI Network for Variable Size FFT's", IEEE Transactions on Computers, vol. 32, no. , pp. 756-760, August 1983, doi:10.1109/TC.1983.1676316
82 ms
(Ver 3.3 (11022016))