The Equivalence of Fast Algorithms for Convolution, Parallel FIR Filters, Polynomial Modular Multiplication, and Pointwise Multiplication in DFT/NTT Domain

Keshab K. Parhi. The Equivalence of Fast Algorithms for Convolution, Parallel FIR Filters, Polynomial Modular Multiplication, and Pointwise Multiplication in DFT/NTT Domain. In 59th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, October 26-29, 2025. pages 1278-1282, IEEE, 2025. [doi]

Abstract

Abstract is missing.