A VLSI Network for Variable Size FFT's

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.

[1]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[2]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  M. Rem,et al.  Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.

[4]  Peter D. Welch,et al.  Fast Fourier Transform , 2011, Starting Digital Signal Processing in Telecommunication Engineering.

[5]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[6]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .