Non -Restoring Algorithm _

1. Start n <- no. of bits M<- Divisor A<- 0 Q<- Dividend Sign bit of A? Shift Left AQ A = A + M Shift Left AQ A = A - M =0 =1 Sign bit of A? Q0 <- 0 Q0 <- 1 n = n-1 Is n = 0? Yes Sign bit of A? No Quotient in Q and Remainder in A Stop A = A-M =0 =1 =1 =0

2. 11(Dividend) /3 (Divisor) = 3 (Quotient) and 2 (Remainder) • M (Divisor) = 3 = 00011 • -M= 11101 • Q (Dividend) =11 = 1011 • A (Accumulator) =0 =00000

3. Tracing n M A Q Action/Comment 4 00011 00000 1011 Initialization 00001 011_ SL AQ 11110 011_ A = A - M 3 11110 0110 Q0 <- 0 11100 110_ SL AQ 11111 110_ A = A+M 2 11111 1100 Q0 <- 0 11111 100_ SL AQ 00010 100_ A = A+M 1 00010 1001 Q0 <- 1 00101 001_ SL

4. Result Quotient in Q (0011)2 => 310 Remainder in A Remainder in A (00010)2 => 210 Result

Non -Restoring Algorithm _

More Related Content

More from SwatiHans10 (20)

Recently uploaded (20)

Non -Restoring Algorithm _