FFT algorithms and their adaptation to parallel processing
From MaRDI portal
Publication:1124776
The parallelization of sequential fast Fourier transforms (FFTs) on high-performance multiprocessor computers has received much attention during the last decade. Based on the concept of index-digit permutation and associated binary address based notation the paper puts the various ideas which have appeared in FFT literature in a common framework. Moreover, three new distributed-memory parallel FFTs along with communication complexity results are presented. The proposed algorithms show alternative ways of designing parallel FFT algorithms with feature reduced communication cost and further flexibility in the choices of data mappings.
Recommendations
- scientific article; zbMATH DE number 1131691
- scientific article; zbMATH DE number 991433
- Fast Fourier transform algorithms for parallel computers
- Parallelization of fast Fourier transforms
- scientific article; zbMATH DE number 3997125
- Publication:4860111
- Further Symmetries of in-Place FFTs
- Parallel FFT algorithms for mimd computers
- scientific article; zbMATH DE number 1267276
Cites work
- A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine
- A Unified Approach to a Class of Data Movements on an Array Processor
- An in-place, in-order prime factor FFT algorithm
- Array Permutation by Index-Digit Permutation
- Bit Reversal on Uniprocessors
- Cooley-Tukey FFT on the Connection Machine
- Gray codes, fast Fourier transforms and hypercubes
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- Implementation of a self-sorting in-place prime factor FFT algorithm
- Implementation of the in-order prime factor transform for variable sizes
- Mapping the synthetic aperture radar signal processor on a distributed-memory MIMD architecture
- Multiprocessor FFTs
- Parallel Processing with the Perfect Shuffle
- Self-Sorting In-Place Fast Fourier Transforms
Cited in
(36)- FFT algorithms for vector computers
- An algorithm for distributed computation of FFTs
- Performing out-of-core FFTs on parallel disk systems
- A parallel FFT algorithm for transputer networks
- Communication efficient multi-processor FFT
- Fast digit-reversal algorithms on a shared-memory machine
- A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine
- Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
- Parallel fast Fourier transforms for electronic structure calculations
- A distributed memory algorithm for 3-D FFTs
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- Parallelization of fast Fourier transforms
- Lesser known FFT algorithms
- scientific article; zbMATH DE number 6611926 (Why is no real title available?)
- scientific article; zbMATH DE number 991433 (Why is no real title available?)
- A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs
- Parallel Compact FFT<scp>s</scp> for Real Sequences
- Parallel FFT algorithms for mimd computers
- scientific article; zbMATH DE number 3976283 (Why is no real title available?)
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- scientific article; zbMATH DE number 1304277 (Why is no real title available?)
- The Future Fast Fourier Transform?
- A parallel 1-D FFT algorithm for the Hitachi SR8000
- scientific article; zbMATH DE number 1756129 (Why is no real title available?)
- Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
- scientific article; zbMATH DE number 3997125 (Why is no real title available?)
- scientific article; zbMATH DE number 3999246 (Why is no real title available?)
- Fast Fourier transform algorithms for parallel computers
- scientific article; zbMATH DE number 279546 (Why is no real title available?)
- Compiler Construction
- Multiprocessor FFTs
- Further Symmetries of in-Place FFTs
- A simple and efficient parallel FFT algorithm using the BSP model
- FFTs on mesh connected computers
- Parallel FFT algorithms using radix 4 butterfly computation on an eight-neighbor processor array
This page was built for publication: FFT algorithms and their adaptation to parallel processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124776)
