Fast polynomial transform algorithms for digital convolution
DOI10.1109/TASSP.1980.1163372zbMATH Open0524.65093OpenAlexW2031855568MaRDI QIDQ3036662FDOQ3036662
Authors: Henri J. Nussbaumer 
Publication date: 1980
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.1980.1163372
fast Fourier transformdigital signal processingmultidimensional discrete Fourier transformfast polynomial transformdigital convolution
Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)
Cited In (18)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Faster polynomial multiplication via multipoint Kronecker substitution
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- A Gröbner free alternative for polynomial system solving
- On fast multiplication of polynomials over arbitrary algebras
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Improved fast polynomial transform algorithm for cyclic convolutions
- Integer multiplication in time \(O(n\log n)\)
- Saber on ESP32
- Polynomial multiplication over finite fields in time \(O(n\log n)\)
- Detecting perfect powers in essentially linear time
- A cache-friendly truncated FFT
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration
- Special algorithms for convolutions over Galois fields
- On algorithms for digital signal processing of sequences
- Irregular primes to 163 million
- An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
- Fast systematic encoding of multiplicity codes
This page was built for publication: Fast polynomial transform algorithms for digital convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036662)
