By Topic

Computing large polynomial products using modular arithmetic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Skavantzos, A. ; Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA ; Mitash, N.

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

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 4 )