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.
No takes yet. Share an insight, caveat, or question.
Bergland et al. (1969) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: