Issue No. 02 - February (1973 vol. 22)
ISSN: 0018-9340
pp: 134-142
E. Kinoshita , Department of Electronics, University of Osaka Prefecture
ABSTRACT
In the residue number system, the arithmetic operations of addition, subtraction, and multiplication are executed in the same period of time without the need for interpositional carry. There is a hope for high-speed operation if residue arithmetic is used for digital computation. The division process, which is one of the difficulties of this operation, is developed in the symmetric residue number system. The method described here is iterative in nature and requires the availability of two tables of the symmetric residue representations of a certain kind of integer. An algorithm for general division is derived, and the way of choosing the entries which are used to find a quotient is discussed.
INDEX TERMS
Additive inverse, algorithm for general division, approximate dividend, approximate divisor, approximate quotient, division with zero remainder, multiplicative inverse, symmetric mixed-radix conversion, symmetric residue number system.
CITATION
Y. Kojima, E. Kinoshita, H. Kosako, "General Division in the Symmetric Residue Number System", IEEE Transactions on Computers, vol. 22, no. , pp. 134-142, February 1973, doi:10.1109/T-C.1973.223674