Two's complement high radix division
A.E. Bashagha, M.K. Ibrahim · 2002
The existing two's complement high radix division algorithms require a full wordlength addition per each possible value of the remainder. Therefore, a huge area is required to implement these algorithms. This paper presents a novel two's complement radix-2/sup k/ structure which replaces the full wordlength addition with a (k+2)-bit addition. Therefore, the required area is reduced significantly without any reduction in speed.