Cooley-Tukey FFT on the Connection Machine

DOI10.1016/0167-8191(92)90066-GzbMATH Open0762.65105OpenAlexW2078492923MaRDI QIDQ1195705FDOQ1195705

Authors: S. Lennart Johnsson, Robert L. Krawitz 

Publication date: 19 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90066-g

Recommendations

• Communication efficient multi-processor FFT
• Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
• FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
• Two-dimensional FFT algorithms on hypercube and mesh machines
• Multiprocessor FFTs

zbMATH Keywords

implementation featuresconnection machineCooley-Tukey fast Fourier transformperformance data

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Cited In (11)

• Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
• A comparison of optimal FFTs on torus and hypercube multicomputers
• FFT algorithms and their adaptation to parallel processing
• Multiprocessor FFTs
• Title not available (Why is that?)
• A distributed memory algorithm for 3-D FFTs
• Gray codes, fast Fourier transforms and hypercubes
• Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique
• Communication efficient multi-processor FFT
• Further Symmetries of in-Place FFTs
• FFTs on mesh connected computers

This page was built for publication: Cooley-Tukey FFT on the Connection Machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195705)