A Fast Fourier Trans- form Algorithm for a Global, Highly Parallel Processor
Bell Telephone · 1969
A fast Fourier transform (FFT) algorithm is presented for an unstructured, parallel ensemble of computing elements with global control. The procedure makes efficient use of a fixed-size memory and minimizes data transmission between computing elements. Included are some practical considerations of the trade-offs between element utilization and gain of computing speed via parallelism.