Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
From MaRDI portal
Publication:3698248
DOI10.1109/TASSP.1984.1164395zbMath0577.65140MaRDI QIDQ3698248
Publication date: 1984
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
fast Fourier transformation; discrete Fourier transformation; recursive cyclotomic factorization algorithm
42A15: Trigonometric interpolation
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
The Tangent FFT, Improvement of the discrete cosine transform calculation by means of a recursive method, Fast Fourier transformation based on number theoretic transforms, Fast discrete transforms by means of eigenpolynomials