Can please Someone explained this Booth Algorithm in detailed.... All steps and how Solution occured

And how 1110 1101 0 occured on second Line

Booth's Algorithm Example - Let's do 0010 x 1101 (2x-3) Iteration Implementation 3 Multiplicand Step Product 0 initial values 0010 000011010 0010 1110 11010 1 10 -> product = product - multiplicand shift right 01 -> product = product + multiplicand 1111 01101 0010 2 0001 01101 0000 101110 shift right 10 -> product = product - multiplicand shift right 0010 1110 10110 3 1111 01011 11 -> no op 0010 1111 0101 1 4 shift right 1111 10101