Sciweavers

Share
JCP
2007

Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory

8 years 10 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents 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 Winograd’s Minimal Multiplicative Complexity Theorem, obtaining a set of formulations that simplify cyclic convolution (CC) computations. In particularly, this work 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. The proposed algorithms are compared against existing algorithms developed making use of the CRT and it is shown that these proposed algorithms exhibit an advantage in computational efficiency. They are also compared against other algorithms that make use of the Fast Fourier Transform (FFT) to perform indirect CC operations, thus, demonstr...
Abraham H. Diaz-Perez, Domingo Rodríguez
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JCP
Authors Abraham H. Diaz-Perez, Domingo Rodríguez
Comments (0)
books