An algorithm for distributed computation of FFTs
Distributed computation of a one-dimensional radix-2 FFT with N data points on an SIMD parallel computer with P processors and butterfly interconnection network (N and P are powers of 2). Special consideration is devoted to fault tolerance using S spare processors.
scientific article; zbMATH DE number 4035098