Design Polynomial Matrix Multiplication By Using Circular Convolution Theorem

Abstract

The main aim of this project is design polynomial matrix multiplication by using circular convolution theorem. This work exhibits a scientific system for the advancement of productive calculations for cyclic convolution calculations. The system depends on the Chinese Reminder Theorem (CRT).In especially, this work concentrates on the number-crunching multifaceted nature of a grid vector item when this item speaks to a CC computational operation or it speaks to a polynomial duplication modulo the polynomial z N-1, where N speaks to the most extreme length of every polynomial factor what's more, it is set to be an energy of 2. The proposed calculations are looked at against existing calculations created making utilization of the CRT and it is demonstrated that these proposed calculations display favorable position in computational effectiveness. They are additionally thought about against different calculations that influence utilization of the Fast Fourier to change (FFT) to perform circuitous CC operations, accordingly, showing a portion of the benefits of the proposed advancement structure.