Two-dimensional FFT algorithms on hypercube and mesh machines
From MaRDI portal
Recommendations
- Parallel FFT algorithms for mimd computers
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
- Two and three dimensional FFTs on highly parallel computers
- scientific article; zbMATH DE number 991433
- Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
Cited in
(13)- Distributed memory parallel architecture based on modular linear arrays for 2-D separable transforms computation
- Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm
- Efficient 2D FFT implementation on mediaprocessors
- Cooley-Tukey FFT on the Connection Machine
- scientific article; zbMATH DE number 123830 (Why is no real title available?)
- In-place butterfly-style FFT of 2-D real sequences
- A comparison of optimal FFTs on torus and hypercube multicomputers
- Two and three dimensional FFTs on highly parallel computers
- FFTs on mesh connected computers
- scientific article; zbMATH DE number 147703 (Why is no real title available?)
- Gray codes, fast Fourier transforms and hypercubes
- On the communication complexity of generalized 2-D convolution on array processors
- 2D grid architectures for the DFT and the 2D DFT
This page was built for publication: Two-dimensional FFT algorithms on hypercube and mesh machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803430)
