Two's complement circuit word division

Abstract

Transformation of a basic modulus remainder minimising strategy with signed quotient bits is a direct approach to the two's complement non-restoring division algorithm with non-negative quotient bits. Normalised variables express the remainder recurrent relationship in a suitable form for computation with a priori specified dynamic ranges of the divisor, dividend and remainder variables. Further transformation to circuit word variables conveniently expresses the division algorithm directly in terms of the state of the computed variables. The circuit word formulation also provides a concise mathematical basis for two's complement arithmetic operations.