FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2

DOI10.1142/S0129053389000111zbMATH Open0725.65149MaRDI QIDQ5203651

Ray A. Kamin III, George B. III Adams

Publication date: 1989

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

zbMATH Keywords

parallel computersPerformanceSIMDConnection Machine CM-2fast Fourier transform algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A high-performance fast Fourier transform algorithm for the Cray-2 👍 👎
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures 👍 👎
• On a fast algorithm for computing the Fourier transform 👍 👎
• Very fast computation of the radix-2 discrete Fourier transform 👍 👎
• Fast Fourier Transform Algorithms for Parallel Computers 👍 👎

This page was built for publication: FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2

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