Two´s complement division without using the set of full precision comparisons

It is well known that the existing two´s complement radix-2^k division methods require a set of full wordlength comparisons of the multiples of the divisor against the shifted remainder. For fast division, these comparisons should be implemented in parallel. Therefore, a huge area is required to implement such high radix division. The paper presents a novel two´s complement radix-2^k division algorithm. For the first time, the set of full precision additions are replaced with a set of (k+2)-bit additions. Then, only two full wordlength additions are required to select the k-bit quotient digit out of two values selected by the (k+2)-bit comparisons. As a result, the required area is reduced by 77% with the speed of the two algorithms are nearly the same. Moreover, the speed of the new algorithm can be made faster by using one of the known fast adders because only two full precision additions (rather than the set of the full precision additions) per radix-2^k quotient digit is required