This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Use of Residue Arithmetic for Computation
December 1974 (vol. 23 no. 12)
pp. 1315-1317
D.K. Banerji, Department of Computer Science, University of Ottawa
Residue arithmetic offers the possibility of "carryfree" arithmetic as far as the operations of addition, subtraction, and multiplication are concerned. It is faster to implement these operations using residue arithmetic as compared to implementation using binary arithmetic. However, the process of algebraic sign detection is much slower in residue arithmetic and tends to offset the advantage of speed in the above three operations.
Index Terms:
Algebraic sign detection, binary arithmetic, relative speed, residue arithmetic, residue number systems.
Citation:
D.K. Banerji, "On the Use of Residue Arithmetic for Computation," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1315-1317, Dec. 1974, doi:10.1109/T-C.1974.223855
Usage of this product signifies your acceptance of the Terms of Use.