Abstract
A parallelization is presented of the Cooley-Tukey FFT algorithm that is implemented on a shared-memory MIMD (nonvector) machine. A parallel algorithm is presented for a one-dimensional Fourier transform with performance analysis. For a large array of complex numbers to be transformed, an almost linear speedup is demonstrated. This algorithm can be executed by any number of processors, but generally the number is much less than the length of the input data.
| Original language | English |
|---|---|
| Pages (from-to) | 63-70 |
| Number of pages | 8 |
| Journal | Proceedings of the International Conference on Parallel Processing |
| Volume | 3 |
| State | Published - 1989 |
| Event | Proceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA Duration: 8 Aug 1989 → 12 Aug 1989 |