Computing large polynomial products using modular arithmetic

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. >

[1]  F. Taylor,et al.  On the Polynomial Residue Number System , 1991 .

[2]  Fred J. Taylor,et al.  On the polynomial residue number system [digital signal processing] , 1991, IEEE Trans. Signal Process..

[3]  G. Jullien,et al.  The modified quadratic residue number system (MQRNS) for complex high-speed signal processing , 1986 .

[4]  F. J. Taylor,et al.  Parallel decomposition of multipliers modulo (2/sup n/+or-1) , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[5]  Thanos Stouraitis,et al.  Parallel Decomposition Of Complex Multipliers , 1988, Twenty-Second Asilomar Conference on Signals, Systems and Computers.

[6]  Application of Quadratic-Like complex residue number system arithmetic to ultrasonics , 1984, ICASSP.