# Booth's algorithm Question : Binary Number Arithmetic (Multiplication)

It's being said booth's algorithm produces the output exactly as normal binary multiplication while reducing the number of operations performed and can be used for both positive and negative numbers !

I tried multiplying two 4-bit numbers while I don't get the same result...Please guide what am doing wrong.

Multiplicand : 1101 , Multiplier : 1110,
Recorded Multiplier(Applying skipping over 1's) : 00-10  • (Are you positive about the most significant zero(es) in the "Normal(?) Multiplication" result?) – greybeard Sep 4 '20 at 12:36
• Do you mean in the first row(r1 out of r1,r2,r3,r4) of the multiplication result ? I have done sign extension , since the MSB is Zero so the sign 0 will be extended further ! – Dan Sep 4 '20 at 12:50
• In Normal Multiplication we don't extend the sign so for Normal Multiplication the Result will be : 010110110(Correction) I took it by mistake , But the results are still not equal ! – Dan Sep 4 '20 at 13:14
• (I meant just summing the digits shown: there's a "double overflow" from bit 5, I think mechanically that should read 11010110.) For the overall approach, please visit en.wikipedia on signed binary multiplication and Booth encoding. – greybeard Sep 4 '20 at 16:00