Cooley-Tukey FFT on the Connection Machine
- 1 November 1992
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 18 (11) , 1201-1221
- https://doi.org/10.1016/0167-8191(92)90066-g
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Communication efficient multi-processor FFTJournal of Computational Physics, 1992
- Ordered fast fourier transforms on a massively parallel hypercube multiprocessorJournal of Parallel and Distributed Computing, 1991
- Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communicationJournal of Parallel and Distributed Computing, 1991
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble ArchitecturesSIAM Journal on Matrix Analysis and Applications, 1988
- Multiprocessor FFTsParallel Computing, 1987
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965