ABSTRACT

We consider a residue number system using n pairwise relatively prime moduli m<inf>1</inf>,?,m<inf>n</inf>to represent any integer X in the range M/ 2=X>M/2, when M = ?mi. The moduli m<inf>i</inf>are chosen to be of the 2-1 type, in order that the residue arithmetic can be implemented by means of binary registers and binary logic. Further, for each residue number X, a magnitude index P<inf>x</inf>is maintained for all arithmetic operations. We investigate the properties of such a system and derive the addition, subtraction, multiplication, sign determination, and overflow detection algorithms. The proposed organization is found to improve the operation times for sign detection and overflow detection operations, while rendering multiplication to be a difficult operation.

INDEX TERMS

Base extension, index generation logic, magnitude index, modular adders, naturalized form, overflow detection, residue multiplication, residue number system, scale by 2, sign determination.

CITATION

A. Trehan and T. Rao, "Binary Logic for Residue Arithmetic Using Magnitude Index," in

*IEEE Transactions on Computers*, vol. 19, no. , pp. 752-757, 1970.

doi:10.1109/T-C.1970.223026

CITATIONS