This report gives proofs that on a two's complement computer, signed and unsigned integer division by any constant can be replaced by a multiplication by another constant and a few other instructions. Algorithms are given for computing the multiplier corresponding to a given divisor.
By: Henry S. Warren, Jr.
Published in: RC18601 in 1992
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .