Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms

DOI10.1147/RD.222.0134MaRDI QIDQ4158441zbMATH OpenOpenAlexFDO

Authors Henri J. Nussbaumer, Philippe Quandalle

Publication date 1978

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fb48c62814707e0692d61c4ba16a577e28cc3ba1

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited in

(4)

• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
• Integer multiplication in time \(O(n\log n)\)
• Group Convolutions and Matrix Transforms
• Polynomial multiplication over finite fields in time \(O(n\log n)\)

This page was built for publication: Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158441)