An efficient algorithm for performing a fast Fourier transform on a data parallel computer is presented. The algorithm allows both the decimation in time (bit reversal) and Danielson–Lanczos (butterfly) phases to be executed in log(N) steps, where N is the size of the transform. Pseudocode is given for implementing the algorithm on a Connection Machine.

This content is only available via PDF.
You do not currently have access to this content.