the left (to combine with fractional division) and then performing a right shift of
n - N digits.
As in the fractional division discussed before, the use of signed quotient
digits requires the conversion to conventional representation and the correction
to obtain a positive remainder.
Moreover, since the remainder should be less than the divisor and the divisor
has n log 2 r - m bits, we obtain
w [N]2 n
l~ --m
if w [N] > 0 5.49
rem -- ( w [ N] + d f) 2 n
l~
if w [N] < 0
We now show an example of integer division for 8-bit operands using a radix-
4 algorithm
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.