This Article 
 Bibliographic References 
 Add to: 
Binary Logic for Residue Arithmetic Using Magnitude Index
August 1970 (vol. 19 no. 8)
pp. 752-757
We consider a residue number system using n pairwise relatively prime moduli m1,?,mnto represent any integer X in the range M/ 2=X>M/2, when M = ?mi. The moduli miare 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 Pxis 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.
T.R.N. Rao, A.K. Trehan, "Binary Logic for Residue Arithmetic Using Magnitude Index," IEEE Transactions on Computers, vol. 19, no. 8, pp. 752-757, Aug. 1970, doi:10.1109/T-C.1970.223026
Usage of this product signifies your acceptance of the Terms of Use.