Residue polynomial systems
In this paper, we present the basic ideas of the residue polynomial system (RPS), a polynomial analog of the familiar residue number systems (RNS) of integer arithmetic. Many of the properties of the RNS are shared by the RPS. The main exception is that division of polynomials in the RPS is much mor...
Gespeichert in:
Veröffentlicht in: | Theoretical computer science 2002-05, Vol.279 (1), p.29-49 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we present the basic ideas of the residue polynomial system (RPS), a polynomial analog of the familiar residue number systems (RNS) of integer arithmetic. Many of the properties of the RNS are shared by the RPS. The main exception is that division of polynomials in the RPS is much more tractable than its integer counterpart. Examples are included throughout. The underlying field of coefficients for polynomials under consideration can be the reals or the rationals, though extension to the complex field will be needed for division by irreducible quadratic factors. |
---|---|
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/S0304-3975(00)00425-4 |