Title :
Computing large polynomial products using modular arithmetic
Author :
Skavantzos, Alexander ; Mitash, Nilay
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fDate :
4/1/1992 12:00:00 AM
Abstract :
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
Keywords :
digital arithmetic; parallel processing; polynomials; 2D polynomial RNS techniques; PRNS; large polynomial products; modular arithmetic; parallel polynomial multiplication; polynomial residue number system; Arithmetic; Circuits; Digital signal processing; Polynomials; Sufficient conditions;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
