Nesting strategies for prime factor FFT algorithms
From MaRDI portal
Publication:1825020
DOI10.1016/0021-9991(89)90048-XzbMath0683.65119OpenAlexW2087655141MaRDI QIDQ1825020
Publication date: 1989
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(89)90048-x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Self-sorting mixed-radix fast Fourier transforms
- A note on prime factor FFT algorithms
- Fast mixed-radix real Fourier transforms
- Implementation of a self-sorting in-place prime factor FFT algorithm
- A self-sorting in-place prime factor real/half-complex FFT algorithm
- A new set of minimum-add small-n rotated DFT modules
- Implementation of a prime factor FFT algorithm on CRAY-1
- An in-place, in-order prime factor FFT algorithm
- The design of optimal DFT algorithms using dynamic programming
- FFT as Nested Multiplication, with a Twist
- On Computing the Discrete Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: Nesting strategies for prime factor FFT algorithms
