Fast Fourier transform algorithms for parallel computers
From MaRDI portal
Recommendations
Cited in
(18)- FFT algorithms and their adaptation to parallel processing
- A parallel FFT algorithm for transputer networks
- A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
- Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- scientific article; zbMATH DE number 7234326 (Why is no real title available?)
- DFTI---a new interface for Fast Fourier Transform libraries
- scientific article; zbMATH DE number 3942982 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 123802 (Why is no real title available?)
- Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
- A PARALLEL FAST FOURIER TRANSFORM
- scientific article; zbMATH DE number 3997125 (Why is no real title available?)
- scientific article; zbMATH DE number 1391231 (Why is no real title available?)
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
- Fast Fourier Transform (FFT) on GPUs
- Liszt's Ètude S.136 no.1: audio data analysis of two different piano recordings
This page was built for publication: Fast Fourier transform algorithms for parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230478)