Cooley - Tukey FFT on the Connection MachineS

Abstract

We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make eeective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages… (More)

Topics

1 Figure or Table

Cite this paper

@inproceedings{Johnsson1991CooleyT, title={Cooley - Tukey FFT on the Connection MachineS}, author={S. Lennart Johnsson and Robert L. Krawitz}, year={1991} }