Final Division Algorithm

Fill rhs of Remainder with Quotient.

Sub Divisor reg from lhs of Rem

& return result to lhs Rem reg.

test

Rem

Shift Rem reg left

& set rightmost bit

32nd

repeat

Rem�0

Remɘ

< 32

Add Divisor

to lhs of Rem

reg & return

Shf R & set 0

Div�r Remainder

0010 0000 0111

0010 0000 1110

0010 1110 1110

0010 0001 1100

0010 1111 1100

0010 0011 1000

0010 0001 1000

0010 0011 0001

0010 0001 0001

0010 0010 0011

0010 0001 0011

Previous slide

Next slide

Back to first slide

View graphic version