Abstract :
This paper relates previous analyses of the binary SRT division to the theory of multiplier recoding. Since each binary quotient digit has three possible values, the quotient resulting from the SRT division is in recoded form; in this paper it is shown that the recoding is a function of the divisor, and the method for determining the characteristic Boolean function of the recoding is presented. The relationship between the division and the recoding is established by scaling the division in such a way that the scaled "divisor" becomes a constant. Higher radix results are also discussed.
Keywords :
Binary arithmetic, division, minimal representations, multiplication, multiplier recoding, redundancy.; Arithmetic; Boolean functions; Computer science; Statistical analysis; Binary arithmetic, division, minimal representations, multiplication, multiplier recoding, redundancy.;
