CAn anyone explain 'bankers algorithm' and 'Booth's multiplication algorithm'?

booth's multiplication is simple.

>modifies the multiplier using 1 ,0 and -1

>same for both signed and unsigned numbers

bit recording rule

bit i bit i-1 new bit at position i

0 0 0

0 1 1

1 0 -1

1 1 0

eg:

multiplicant ,m =1010(-6)

multiplier q = 1110(-2)

take multiplier and do bit recording for the above table.

multiplier,q : 11100(put a zero as last bit for even digits, i think )

after bit recording ,q: 0 0 -1 0

now do m*q

1 0 1 0 *

0 0 -1 0

---------------

0 0 0 0 0 0 0 0 (sign extend l since multiplying 1 0 1 0*0 = "0" 0 0 0, and sign extend the quoted bit )

0 0 0 0 1 1 0

0 0 0 0 0 0

0 0 0 0 0

--------------

0 0 0 0 1 1 0 0

multiplying by -1 => taking its 2's compliment.

i dont know about banker's algorthim, i am an ECE student

also if multiplier is positive, take the 2's complement of the result to obtain the correct value