FFT algorithms and their adaptation to parallel processing
From MaRDI portal
Publication:1124776
DOI10.1016/S0024-3795(98)10086-1zbMATH Open0938.65157WikidataQ127395942 ScholiaQ127395942MaRDI QIDQ1124776FDOQ1124776
Authors: S. H. Smith 
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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
Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Parallel Processing with the Perfect Shuffle
- Multiprocessor FFTs
- Implementation of a self-sorting in-place prime factor FFT algorithm
- An in-place, in-order prime factor FFT algorithm
- Mapping the synthetic aperture radar signal processor on a distributed-memory MIMD architecture
- Gray codes, fast Fourier transforms and hypercubes
- Self-Sorting In-Place Fast Fourier Transforms
- Implementation of the in-order prime factor transform for variable sizes
- Cooley-Tukey FFT on the Connection Machine
- 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
- Array Permutation by Index-Digit Permutation
- Bit Reversal on Uniprocessors
Cited In (27)
- Title not available (Why is that?)
- An algorithm for distributed computation of FFTs
- Title not available (Why is that?)
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- Parallel Compact FFT<scp>s</scp> for Real Sequences
- Compiler Construction
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
- Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
- Title not available (Why is that?)
- A parallel 1-D FFT algorithm for the Hitachi SR8000
- Multiprocessor FFTs
- A simple and efficient parallel FFT algorithm using the BSP model
- FFT algorithms for vector computers
- Parallelization of fast Fourier transforms
- Parallel FFT algorithms for mimd computers
- Fast Fourier transform algorithms for parallel computers
- A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs
- Fast digit-reversal algorithms on a shared-memory machine
- Lesser known FFT algorithms
- A parallel FFT algorithm for transputer networks
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- Title not available (Why is that?)
- Parallel fast Fourier transforms for electronic structure calculations
- Title not available (Why is that?)
- Communication efficient multi-processor FFT
- Further Symmetries of in-Place FFTs
- FFTs on mesh connected computers
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)
