FFT algorithms for SIMD parallel processing systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
VLSI Architectures for multidimensional fourier transform processing
IEEE Transactions on Computers
The mesh of trees architecture for parallel computation
The mesh of trees architecture for parallel computation
Parallel Implementation of Multidimensional Transforms without Interprocessor Communication
IEEE Transactions on Computers
Parallel implementations of 1-D fast Fourier transform without interprocessor communication
International Journal of Computers and Applications
A hybrid parallel M-D FFT algorithm without interprocessor communication
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: digital speech processing - Volume III
A framework for low-communication 1-D FFT
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A framework for low-communication 1-D FFT
Scientific Programming - Selected Papers from Super Computing 2012
| Hi-index | 0.01 |
A parallel algorithm is proposed for the two-dimensional discrete Fourier transform (2-D DFT) computation which eliminates interprocessor communications and uses only O(N) processors. The mapping of the algorithm onto architectures with broadcast and report capabilities is discussed. Expressions are obtained for estimating the speed performance on these machines as a function of the size N*N of the 2-D DFT, the bandwidth of the communications channel, the time for an addition, the time T(F/sub N/) for a singleprocessing element to perform an N-point DFT, and the degree of parallelism. For single I/O channel machines that are capable of exploiting the full degree of parallelism of the algorithm, attainable execution times are as low as the time T(F/sub N/) plus the I/O time for data upload and download. An implementation on a binary tree computer is discussed.