Question

2. a) Booth's algorithm to find the product of a multiplier, M, and a 12 multiplicand, B, can be summarized by the following table Ca | Multiplier | LSL# ALU | Cout A+0 0 x002 x01 2N x10 (2N+1) A+B0 A-B1 x11 2N x002 2N x01 (2N+1) A+B0 x102 2N A-B1 x112 A+01 Demonstrate how Booth's algorithm performs multiplication by finding the product of 000111102 (M) and 110111002 (B). Each step in the calculation should be given. Give the result in a 16 bit binary format.

Answer 1

M: 0001111 onimev 00000000Hollo OIOLIO Right shift で ....。。) Rigkt shuft 0000000o bolo11 1 1110001 ooo1o1 Riht shift Rigkt shift 千 Rijkt skift II 1o0 01000110 00011 o 10 o1。。。110 Right skeft 2 。。..' '이 A A-M Right shft ↑ 100 100。 Rght stf 1 ' 1 1 1 01 1 허umber Compkment。000 00100001' 이'! 0000010000 mTO00ラMar 午 But result bibA oII 11 0 lo0D