PARALLEL HIGH-RADIX NONRESTORING DIVISION

An algorithm for high-radix nonrestoring division is proposed which co mbines a cost-efficient quotient estimation technique with collapsing of the division into one operation each iteration. The quotient estima tion technique is a direct combinatorial algorithm which allows a more generalized partial remainder than similar studies. In addition, the successor partial remainder is calculated directly from the previous p artial remainder. The intermediate steps of calculating the- next quot ient estimate, multiplying it by the divisor, and then subtracting the result from the previous remainder are telescoped into one step. This is possible due to the use of simple direct combinatorial equations f or the quotient estimate. Thus, one operation is used to generate the next remainder from the previous remainder. This operation is similar to a multiplication with a reduced carry propagate adder. This algorit hm reduces the latency of each iteration to less than the delay of one multiplication. Thus, high-radix nonrestoring division is possible wi th a low latency and no need for an off-chip ROM to hold a quotient es timate.