A prime factor FFT algorithm using high-speed convolution

DOI10.1109/TASSP.1977.1162973MaRDI QIDQ4166174zbMATH OpenOpenAlexFDO

Authors Dean P. Kolba, Thomas W. Parks

Publication date 1977

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.1977.1162973

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms in computer science (68W99)

Cited in

(8)

• A note on prime factor FFT algorithms
• Implementation of a self-sorting in-place prime factor FFT algorithm
• A self-sorting in-place prime factor real/half-complex FFT algorithm
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
• Matrix identities of the fast Fourier transform
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• Realization of discrete Fourier transforms using a nesting algorithm
• Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields

This page was built for publication: A prime factor FFT algorithm using high-speed convolution

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