Revision as of 21:56, 16 November 2016 edit 14.99.229.168 (talk) →How it works ← Previous edit		Revision as of 09:39, 20 January 2017 edit undo 27.251.158.66 (talk) →Example Next edit →
Line 66: # P = 0 0100 000'''0 1'''. The last two bits are 01. #* P = 1 1100 0000 1. P = P + A. # P = 1 1110 0000 0. ~~Right~~right shift. # P = 1 1110 000'''0 0'''. The last two bits are 00. #* P = 1 1111 0000 0. Right shift.

Booth's multiplication algorithm: Difference between revisions