This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
April 1983 (vol. 32 no. 4)
pp. 378-388
P. Kornerup, Department of Computer Science, Aarhus University
The foundations of an arithmetic unit performing the add, subtract, multiply, and divide operations on rational operands are developed. The unit uses the classical Euclidean algorithm as one unified algorithm for all the arithmetic operations, including rounding. Binary implementations are discussed, based on techniques known from SRT division, and utilizing ripple-free borrow-save and carry-save addition. Average time behavior is investigated.
Index Terms:
SRT-division, Borrow-save and carry-save addition, Euclidean algorithm, fixed-slash and floating-slash representations, rational numbers
Citation:
P. Kornerup, D.W. Matula, "Finite Precision Rational Arithmetic: An Arithmetic Unit," IEEE Transactions on Computers, vol. 32, no. 4, pp. 378-388, April 1983, doi:10.1109/TC.1983.1676239
Usage of this product signifies your acceptance of the Terms of Use.