A novel division algorithm that is especially appropriate for residue number systems (RNSs) is presented. It makes use of the fact that the multiplicative inverse element of a divisor which is relatively prime to system moduli can be easily determined in the RNS. The number of its iterations depends only on the magnitude of the divisor and the moduli of the system. The problems in the algorithm realization are analyzed in detail, and a complete solution using the incompletely specified RNS is described.
展开▼
