This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (ii) 10110110111011 First extend the second (unsigned) number to 8 bits as 00111011 Take its 1’s complement as 11000100 Add 1 to get its 2’s complement as 11000101 Add this to the first number as follows: 10110110 + 11000101 101111011 Since the carry arises the 8bit result is correct and it is 01111011 Verify 182 – 59 = 123 Q4. Need 5 bits to represent both +11 and 9 in 2’s complement Multiplicand = 01011 (+11) Multiplier = 10111 (9) Set up table for Booth’s algorithm as given below: A Q Q 1 M Count Remarks 00000 10111 0 01011 5 Intitialize registers01011 10 – subtract A – M 10101 10111 11010 11011 1 4 Shift right 11101 01101 1 3 11 – shift right 11110 10110 1 2 11Shift right +01011 01 add A+M 01001 10110 1 Ignore borrow 00100 11011 0 1 Shift right01011 10 subtract AM 11001 11011 11100 11101 1 0 11 Shift right , stop Product is 1110011101 =  128+16+8+4+1= 99...
View
Full Document
 Spring '11
 BillMongan
 Addition, Multiplication, 8bit unsigned numbers, Booth's multiplication algorithm

Click to edit the document details