Arithmetic division in RNS using Galois Field GF(p)
| Autor: | Salman Talahmeh, Pepe Siy |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Discrete mathematics
Euclidean division Mathematics::Number Theory Parallel computation Short division Computer arithmetic GF(2) Normal basis Embedding problem Computational Mathematics Galois field Number theory Computational Theory and Mathematics Modeling and Simulation Modelling and Simulation ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Modular arithmetic Mathematics of cyclic redundancy checks Finite field arithmetic Hardware_ARITHMETICANDLOGICSTRUCTURES Arithmetic Quotient Mathematics |
| Zdroj: | Computers & Mathematics with Applications. 39(5-6):227-238 |
| ISSN: | 0898-1221 |
| DOI: | 10.1016/s0898-1221(00)00056-0 |
| Popis: | This paper develops an enhanced algorithm for the arithmetic division problem 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 dividend and the divisor, no mixed radix conversion, no quotient estimation before division, no reciprocal estimation of the divisor, and no based extension operation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect