Symmetric Prime Factor Fast Fourier Transform Algorithms

DOI10.1137/0910028MaRDI QIDQ3832031zbMATH OpenOpenAlexFDO

Authors James S. Otto

Publication date 1989

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0910028

zbMATH Keywords

discrete Fourier transformfast Fourier transformprime factor algorithmprime factor FFTreal FFTsymmetric FFT

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Further Symmetries of in-Place FFTs
• Symmetric FFTs
• A self-sorting in-place prime factor real/half-complex FFT algorithm
• Fast Fourier transform algorithms for real and symmetric data
• Efficient address generation for prime factor algorithms (digital signal processing)

Cited in

(6)

• A self-sorting in-place prime factor real/half-complex FFT algorithm
• A Generalized Prime Factor FFT Algorithm for any N = 2p 3q 5r
• Symmetric FFTs
• scientific article; zbMATH DE number 926141 (Why is no real title available?)
• Further Symmetries of in-Place FFTs
• A prime-factor decomposed algorithm for the discrete sine transform

This page was built for publication: Symmetric Prime Factor Fast Fourier Transform Algorithms

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