A Combinatoric Division Algorithm for Fixed-Integer Divisors

  title={A Combinatoric Division Algorithm for Fixed-Integer Divisors},
  author={D. H. Jacobsohn},
  journal={IEEE Transactions on Computers},
  • D. H. Jacobsohn
  • Published 1973
  • Mathematics, Computer Science
  • IEEE Transactions on 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

Efficient Algorithms for Integer Division by Constants Using Multiplication
Asymptotic Optimality of Parallel Short Division
  • Niall Emmart, C. Weems
  • Computer Science
  • 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2016
A fast division technique for constant divisors
Division by invariant integers using multiplication
An overrelaxation for a numerical inverse of a constant
  • H. Asai
  • Mathematics, Computer Science
  • CACM
  • 1980
Fast Random and Sequential Access to Dynamic Memories of Any Size
  • J. Lenfant
  • Computer Science
  • IEEE Transactions on Computers
  • 1977
A Study of High Performance Multiple Precision Arithmetic on Graphics Processing Units
Integer Division by Constants: Optimal Bounds