Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory

Provided by: Academy Publisher
Topic: Hardware
Format: PDF
In this paper, the authors present a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theorem (CRT) and the minimal multiplicative complexity theorem, obtaining a set of formulations that simplify Cyclic Convolution (CC) computations. In particularly, this paper focuses on the arithmetic complexity of a matrix-vector product when this product represents a CC computational operation or it represents a polynomial multiplication modulo the polynomial zN-1, where N represents the maximum length of each polynomial factor and it is set to be a power of 2.

Find By Topic