Implementation of a self-sorting in-place prime factor FFT algorithm
From MaRDI portal
Publication:1087005
DOI10.1016/0021-9991(85)90164-0zbMath0609.65099OpenAlexW2042527476MaRDI QIDQ1087005
Publication date: 1985
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(85)90164-0
Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)
Related Items
A self-sorting in-place prime factor real/half-complex FFT algorithm, A new set of minimum-add small-n rotated DFT modules, Automatic derivation and implementation of fast convolution algorithms, FFT algorithms and their adaptation to parallel processing, A numerical study of turbulent supersonic isothermal-wall channel flow, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, Nesting strategies for prime factor FFT algorithms, In-place self-sorting fast Fourier transform algorithm with local memory references
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-sorting mixed-radix fast Fourier transforms
- A note on prime factor FFT algorithms
- Fast mixed-radix real Fourier transforms
- An in-place, in-order prime factor FFT algorithm
- Implementation of the in-order prime factor transform for variable sizes
- The design of optimal DFT algorithms using dynamic programming
- On the structure of efficient DFT algorithms
- On Computing the Discrete Fourier Transform
- Index mappings for multidimensional formulation of the DFT and convolution
- A prime factor FFT algorithm using high-speed convolution
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- The Relationship Between Two Fast Fourier Transforms
