# 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 Trans. Computers}, year={1973}, volume={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

#### 14 Citations

Faster remainder by direct computation: Applications to compilers and software libraries

- Computer Science, Mathematics
- Softw. Pract. Exp.
- 2019

Asymptotic Optimality of Parallel Short Division

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

Correctly rounded constant integer division via multiply-add

- Computer Science
- 2012 IEEE International Symposium on Circuits and Systems
- 2012

Efficient Combinational Circuits for Division by Small Integer Constants

- Mathematics, Computer Science
- 2016 IEEE 23nd Symposium on Computer Arithmetic (ARITH)
- 2016

A bibliography on computer arithmetic

- Computer Science
- 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)
- 1975