Fast computation of discrete Fourier transforms using polynomial transforms
From MaRDI portal
Publication:3886825
DOI10.1109/TASSP.1979.1163216zbMath0443.65109MaRDI QIDQ3886825
Philippe Quandalle, Henri J. Nussbaumer
Publication date: 1979
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
tables; fast Fourier transform; efficient algorithms; polynomial transforms; two-dimensional discrete Fourier transform; Winograd Fourier Transform; minimum number of operations; flow-charts; short-length algorithms; Winograd's method
68Q25: Analysis of algorithms and problem complexity
60G35: Signal detection and filtering (aspects of stochastic processes)
42A15: Trigonometric interpolation
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
Modified FFTs for Fused Multiply-Add Architectures, Group Convolutions and Matrix Transforms, A note on prime factor FFT algorithms, Abelian semi-simple algebras and algorithms for the discrete Fourier transform, Index transforms for N-dimensional DFT's, The inverse of an automorphism in polynomial time, 2-D FFT algorithm by matrix factorization in a 2-D space, Vector coding algorithms for multidimensional discrete Fourier transform