Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform

DOI10.1109/TASSP.1984.1164395zbMath0577.65140MaRDI QIDQ3698248

Jean-Bernard Martens

Publication date: 1984

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformationdiscrete Fourier transformationrecursive cyclotomic factorization algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Fast Fourier transformation based on number theoretic transforms ⋮ The Tangent FFT ⋮ Improvement of the discrete cosine transform calculation by means of a recursive method ⋮ Fast discrete transforms by means of eigenpolynomials

This page was built for publication: Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform