IEE Proceedings E Computers and Digital Techniques · 1990 · 13 citations · 15 references
ComputingComputer EngineeringComputer ScienceParallel AlgorithmsParallel ComputingReconfigurable ComputingData ParallelismDigital Signal ProcessingParallel ArchitecturesParallel Computer ArchitectureParallel Computing SystemsParallel Data StructuresComplexityFast Fourier TransformParallel Algorithm ComplexityParallel Algorithms On HypercubesParallel ProcessingShared MemorySimd ArchitecturesStorage
The paper presents the in-place implementation of the multidimensional radix 2 fast Fourier transform (FFT), along with the corresponding algorithm for data shuffling (bit-reversal) on SIMD hypercube computers. Each processor possesses its own non-shared memory, the number of processors being less than or equal to the number of data. The flexibility of the proposed algorithm is based on the scheme of information storage that has been chosen and in the decomposition/reconfiguration of the hypercube in subhypercubes that allow the parallel processing of multiple one-dimensional FFTs. This parallel FFT algorithm has an optimum performance, since the data redundancy is null and the algorithmic complexity is optimum.
15
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text