Draw the data path of sequential n-bit binary divider.Give the non-restoring division algorithm for unsigned integers.Also illustrate algorithm for unsigned integer with a suitable example.

Datapath of sequential n-bit binary divider :

Algorithm for non-restoring division :

Non-restoring division operation :
Step 1 : If the sign of A is 0, shift A and Q left one bit position and subtract divisor from A; otherwise, shift A and Q left and add divisor to A.
Step 2 : If the sign of A is 0, set Q₀to 1; otherwise, set Q₀ to 0.
Step 3 : Repeat steps 1 and 2 for n times.
Step 4 : If the sign of A is 1, add divisor to A. Step 4 is required to leave the proper positive remainder in A at the end of n cycles.

For example, consider 4-bit dividend and 2-bit divisor :

In given example after 4 cycles register A is positive and hence step 3 is not required.