Title :
A VLSI Network for Variable Size FFT´s
Author_Institution :
Istituto Matematico G. Castelnuovo, Università di Roma, Città Universitaria
Abstract :
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.
Keywords :
Area-time complexity; Fourier transformation; VLSI; shuffle-exchange connections; Computational modeling; Computer networks; Concurrent computing; Fast Fourier transforms; Fault tolerance; Fault tolerant systems; Markov processes; Notice of Violation; Throughput; Very large scale integration; Area-time complexity; Fourier transformation; VLSI; shuffle-exchange connections;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1983.1676316
