DocumentCode
1148875
Title
Time-Space Tradeoffs on Back-to-Back FFT Algorithms
Author
Carlson, David A.
Author_Institution
Department Electrical and Computer Engineering, University of Massachusetts
Issue
6
fYear
1983
fDate
6/1/1983 12:00:00 AM
Firstpage
585
Lastpage
589
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 = Ω(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.
Keywords
Pebble game; permutation graph; polynomial multiplication; straight-line algorithm; time-space tradeoff; Algorithm design and analysis; Boolean functions; Circuits; Computational complexity; Computer science; Costs; Fast Fourier transforms; Polynomials; Time measurement; Pebble game; permutation graph; polynomial multiplication; straight-line algorithm; time-space tradeoff;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676281
Filename
1676281
Link To Document