A Combinatoric Division Algorithm for Fixed-Integer Divisors

  title={A Combinatoric Division Algorithm for Fixed-Integer Divisors},
  author={D. H. Jacobsohn},
  journal={IEEE Trans. Computers},
  • D. H. Jacobsohn
  • Published 1973
  • Mathematics, Computer Science
  • IEEE Trans. Computers
A procedure is presented for performing a combinatoric fixed-integer division that satisfies the division algorithm in regard to both quotient and remainder. In this procedure, division is performed by multiplying the dividend by the reciprocal of the divisor. The reciprocal is, in all nontrivial cases, of necessity a repeating binary fraction, and two treatments for finding the product of an integer and repeating binary fraction are developed. Two examples of the application of the procedure… Expand

Topics from this paper

Special Cases of Division
Fast Constant Division Routines
  • S. Li
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1985
Asymptotic Optimality of Parallel Short Division
  • Niall Emmart, C. Weems
  • Computer Science
  • 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2016
Correctly rounded constant integer division via multiply-add
On a new division algorithm
Efficient Combinational Circuits for Division by Small Integer Constants
A bibliography on computer arithmetic


A Suggestion for a Fast Multiplier
  • C. Wallace
  • Computer Science
  • IEEE Trans. Electron. Comput.
  • 1964