An algorithm for the fast Fourier transform on a Connection Machine
- 1 January 1990
- journal article
- conference paper
- Published by AIP Publishing in Computers in Physics
- Vol. 4 (1) , 86-90
- https://doi.org/10.1063/1.168379
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: