Modulo multipliers using polynomial rings

The performance of many DSP chips depends to a great extent on their multiply-accumulate (MAC) speed. In this direction, the use of residue arithmetic has been proved to enhance the speed of multiplier units. One approach has been to convert all multiplication operations to addition, thereby speeding up the whole operation. This was made possible by defining a logarithmic transform for the integers in a finite field, more specifically in a prime field GF(p). The author extends this approach to the case of polynomial rings (quotient rings), thereby providing more choices for the selection of moduli in RNS multipliers