Time-Space Tradeoffs on Back-to-Back FFT Algorithms

Authors:
D. A. Carlson
Affiliations:
Department Electrical and Computer Engineering, University of Massachusetts
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 6
Cited 0

A Permutation Network

Journal of the ACM (JACM)
Shifting Graphs and Their Applications

Journal of the ACM (JACM)
Time-space and size-space tradeoffs for oblivious computations

Time-space and size-space tradeoffs for oblivious computations
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Comparative schematology

Record of the Project MAC conference on concurrent systems and parallel computation
Combinational complexity of some monotone functions

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper examines the performance of back-to-back applications of a fast Fourier transform algorithm with respect to computational time and space. Using a well-known pebble game as an analysis technique, a lower bound is derived on the product of time and space, which is of the form T · S = O(n2 log2n) for an n-input back-to-back FFT. The implications of this lower bound on applications of a back-to-back FFT circuit, such as polynomial multiplication and permutation graphs, are also discussed.