FFT algorithms and their adaptation to parallel processing
From MaRDI portal
Publication:1124776
DOI10.1016/S0024-3795(98)10086-1zbMath0938.65157MaRDI QIDQ1124776
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
65T50: Numerical methods for discrete and fast Fourier transforms
65Y05: Parallel numerical computation
Cites Work
- Unnamed Item
- Multiprocessor FFTs
- Mapping the synthetic aperture radar signal processor on a distributed-memory MIMD architecture
- Implementation of a self-sorting in-place prime factor FFT algorithm
- Gray codes, fast Fourier transforms and hypercubes
- Cooley-Tukey FFT on the Connection Machine
- A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine
- An in-place, in-order prime factor FFT algorithm
- Self-Sorting In-Place Fast Fourier Transforms
- Implementation of the in-order prime factor transform for variable sizes
- A Unified Approach to a Class of Data Movements on an Array Processor
- Array Permutation by Index-Digit Permutation
- Bit Reversal on Uniprocessors
- Parallel Processing with the Perfect Shuffle