Pages that link to "Item:Q1803430"
From MaRDI portal
The following pages link to Two-dimensional FFT algorithms on hypercube and mesh machines (Q1803430):
Displaying 15 items.
- Efficient 2D FFT implementation on mediaprocessors (Q436199) (← links)
- FFTs on mesh connected computers (Q672101) (← links)
- On the scalability of 2-D discrete wavelet transform algorithms (Q678247) (← links)
- Gray codes, fast Fourier transforms and hypercubes (Q1097676) (← links)
- Bluestein's FFT for arbitrary \(N\) on the hypercube (Q1179208) (← links)
- Cooley-Tukey FFT on the Connection Machine (Q1195705) (← links)
- 2-D FFT algorithm by matrix factorization in a 2-D space (Q1316209) (← links)
- Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication (Q1350022) (← links)
- Two and three dimensional FFTs on highly parallel computers (Q1819919) (← links)
- A distributed memory algorithm for 3-D FFTs (Q1919366) (← links)
- Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm (Q2666784) (← links)
- (Q4025522) (← links)
- 2D grid architectures for the DFT and the 2D DFT (Q4312806) (← links)
- A comparison of optimal FFTs on torus and hypercube multicomputers (Q5940995) (← links)
- Distributed memory parallel architecture based on modular linear arrays for 2-D separable transforms computation (Q5947744) (← links)
