Fast computation of discrete Fourier transforms using polynomial transforms
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)
Full work available at URL: https://doi.org/10.1109/tassp.1979.1163216
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