A VLSI Network for Variable Size FFT's

Authors:
G. Bongiovanni
Affiliations:
Istituto Matematico G. Castelnuovo, Università di Roma, Città Universitaria
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 4
Cited 0

An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
A complexity theory for VLSI

A complexity theory for VLSI
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
The cube-connected-cycles: A versatile network for parallel computation

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	14.98

Visualization

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.