论文信息 - A rational arithmetic processor

A rational arithmetic processor

An arithmetic processor based upon a rational representation scheme is examined. The key feature of this rational processor is its ability to efficiently reduce a result ratio to its irreducible form (the greatest common divisor of the numerator and denominator is unity). The reduction algorithm presented generates the reduced ratio in parallel with the evaluation of the ratio's greatest common divisor. Hardware designs for the reduction algorithm and the basic arithmetic operations are given.

Mary Jane Irwin | Dwight R. Smith | M. Irwin | Dwight R. Smith

[1] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[2] R. Nigel Horspool,et al. A New Representation of the Rational Numbers for Fast Easy Arithmetic , 1979, SIAM J. Comput..

[3] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.

[4] Kai Hwang,et al. An interleaved rational/radix arithmetic system for high-precision computations , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[5] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .

[6] Peter Kornerup,et al. A feasibility analysis of fixed-slash rational arithmetic , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[7] Peter Kornerup,et al. A feasibility analysis of binary fixed-slash and floating-slash number systems , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).