Question

Could you give me a 7-bit example of non-restoring binary division algorithm using:

Dividend: 1100000

Divisor: 01011

Answer 1

• Steps to perform  Non_Restoring Division for Unsigned Integer
• Step-1: First the registers are initialized with corresponding values (Q = Dividend, M = Divisor, A = 0, n = number of bits in dividend)here Q=1100000 Divisor=01011 n=7
• Step-2: Check the sign bit of register A(most significant bit of A)
• Step-3: If it is 1 shift left content of AQ and perform A = A+M, otherwise shift left AQ and perform A = A-M (means add 2’s complement of M to A and store it to A)
• Step-4: Check again the sign bit of register A (most significant bit of A)
• Step-5: If sign bit is 1 Q[0] become 0 otherwise Q[0] become 1 (Q[0] means least significant bit of register Q)
• Step-6: Decrements value of n by 1 ie n=n-1
• Step-7: If n is not equal to zero go to Step 2 otherwise go to next step
• Step-8: If sign bit of A is 1 then perform A = A+M
• Step-9: Register Q contain quotient and A contain remainder

• Diviidend =(1100000)₂=(96)₁₀

  Divisor: (01011)₂=(11)₁₀

• Final answer: Quotient=contents of Q=(0001000)₂=(8)₁₀

  • Remainder= contents of A=(01000)₂=(8)₁₀

•