Booth's multiplication algorithm: Difference between revisions

Revision as of 09:56, 28 January 2018

Revision as of 10:02, 6 February 2018

Line 69:

*# P = 1 1110 000'''0 0'''. The last two bits are 00.

*#* P = 1 1111 0000 0. Right shift.

* The product is 11110000 (after discarding the first and the last bit) which is −16.

==How it works==