A prime factor FFT algorithm using high-speed convolution

DOI10.1109/TASSP.1977.1162973zbMath0385.65063OpenAlexW1985765205MaRDI QIDQ4166174

Thomas W. Parks, Dean P. Kolba

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)

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, Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP, Matrix identities of the fast Fourier transform, Realization of discrete Fourier transforms using a nesting algorithm, Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields, A note on prime factor FFT algorithms, Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)