Arithmetic division in RNS using Galois Field GF(p)

Citation
S. Talahmeh et P. Siy, Arithmetic division in RNS using Galois Field GF(p), COMPUT MATH, 39(5-6), 2000, pp. 227-238
Citations number
15
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTERS & MATHEMATICS WITH APPLICATIONS
ISSN journal
08981221 → ACNP
Volume
39
Issue
5-6
Year of publication
2000
Pages
227 - 238
Database
ISI
SICI code
0898-1221(200003)39:5-6<227:ADIRUG>2.0.ZU;2-E
Abstract
This paper develops an enhanced algorithm for the arithmetic division probl em in the Residue Number System. The proposed algorithm is based on Galois Field Theory GF(p). Mapping the arithmetic division problem over the Galois Field GF(p) eliminates many of the limitations of existing algorithms. The advantage of the proposed algorithm is that it has no restriction on the d ividend and the divisor, no mixed radix conversion, no quotient estimation before division, no reciprocal estimation of the divisor, and no based exte nsion operation. (C) 2000 Elsevier Science Ltd. All rights reserved.