Computing large polynomial products using modular arithmetic
Alexander Skavantzos, N. Mitash · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1992
The polynomial residue number system (PRNS) has been proven to be a system in which totally parallel polynomial multiplication can be achieved, provided that arithmetic takes place in some carefully chosen ring. However, such a system has a major limitation: the size of the ring used is proportional to the size of the polynomials to be multiplied. As a result, in order to multiply large polynomials in a fixed size ring, one must involve 2-D PRNS techniques. Such 2-D PRNS techniques are summarized.>