This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1983 (vol. 32 no. 6)
pp. 585-589
D.A. Carlson, Department Electrical and Computer Engineering, University of Massachusetts
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.
Index Terms:
time-space tradeoff, Pebble game, permutation graph, polynomial multiplication, straight-line algorithm
Citation:
D.A. Carlson, "Time-Space Tradeoffs on Back-to-Back FFT Algorithms," IEEE Transactions on Computers, vol. 32, no. 6, pp. 585-589, June 1983, doi:10.1109/TC.1983.1676281
Usage of this product signifies your acceptance of the Terms of Use.