# A Combinatoric Division Algorithm for Fixed-Integer Divisors

@article{Jacobsohn1973ACD, title={A Combinatoric Division Algorithm for Fixed-Integer Divisors}, author={D. H. Jacobsohn}, journal={IEEE Transactions on Computers}, year={1973}, volume={C-22}, pages={608-610} }

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

#### 10 Citations

Efficient Algorithms for Integer Division by Constants Using Multiplication

- Computer Science, Mathematics
- Comput. J.
- 2008

Asymptotic Optimality of Parallel Short Division

- Computer Science
- 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
- 2016

Fast Random and Sequential Access to Dynamic Memories of Any Size

- Computer Science
- IEEE Transactions on Computers
- 1977