An in-place, in-order prime factor FFT algorithm

DOI10.1109/TASSP.1981.1163645zbMath0524.65091OpenAlexW2121362046MaRDI QIDQ3036659

Peter W. Eschenbacher, C. Sidney Burrus

Publication date: 1981

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tassp.1981.1163645

zbMATH Keywords

comparisonfast Fourier transformdiscrete Fourier transformFortran programCooley-Tukey algorithmWinograd nested algorithm

Mathematics Subject Classification ID

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

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 ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ Fast Fourier transformation based on number theoretic transforms ⋮ FFT algorithms and their adaptation to parallel processing ⋮ Efficient number theoretic transforms for convolutions using ROM arrays ⋮ A fast, accurate, and smooth planetary ephemeris retrieval system ⋮ Nesting strategies for prime factor FFT algorithms ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references