Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
From MaRDI portal
Publication:4158441
DOI10.1147/rd.222.0134zbMath0379.65062OpenAlexW1991675203MaRDI QIDQ4158441
Philippe Quandalle, Henri J. Nussbaumer
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
Related Items
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms ⋮ Group Convolutions and Matrix Transforms