Two-dimensional FFT algorithms on hypercube and mesh machines

DOI10.1016/0165-1684(93)90017-5zbMATH Open0796.68108OpenAlexW2004542111MaRDI QIDQ1803430FDOQ1803430

Authors: G. Angelopoulos, Ioannis Pitas 

Publication date: 29 June 1993

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(93)90017-5

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

zbMATH Keywords

hypercubeparallel computationfast Fourier transformmesh connected computers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Cited In (13)

• A comparison of optimal FFTs on torus and hypercube multicomputers
• On the communication complexity of generalized 2-D convolution on array processors
• Cooley-Tukey FFT on the Connection Machine
• Title not available (Why is that?)
• In-place butterfly-style FFT of 2-D real sequences
• Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm
• Gray codes, fast Fourier transforms and hypercubes
• Efficient 2D FFT implementation on mediaprocessors
• Two and three dimensional FFTs on highly parallel computers
• Title not available (Why is that?)
• Distributed memory parallel architecture based on modular linear arrays for 2-D separable transforms computation
• 2D grid architectures for the DFT and the 2D DFT
• FFTs on mesh connected computers

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)