A Combinatoric Division Algorithm for Fixed-Integer Divisors
- 1 June 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (6), 608-610
- https://doi.org/10.1109/tc.1973.5009114
Abstract
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 are given.Keywords
This publication has 1 reference indexed in Scilit:
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964