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

DOI10.1109/TASSP.1981.1163645MaRDI QIDQ3036659zbMATH OpenOpenAlexFDO

Authors C. Sidney Burrus, Peter W. Eschenbacher

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

comparisonCooley-Tukey algorithmdiscrete Fourier transformfast Fourier transformFortran programWinograd nested algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

Cited in

(11)

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

This page was built for publication: An in-place, in-order prime factor FFT algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036659)