Login / Signup
The Dataflow Time and Space Complexity of FFTs.
A. P. Wim Böhm
Robert E. Hiromoto
Published in:
J. Parallel Distributed Comput. (1993)
Keyphrases
</>
space complexity
data flow
parallel computing
worst case
basis functions
arc consistency
design methodology
control flow
database machine
space requirements
fast fourier transform
graph transformation
worst case time complexity
search algorithm
signal processing