Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

Show step by step the multiplication process using Booth’s algorithm when (+ 15) and (– 13) numbers are multiplied.Assume 5-bit registers that hold signed numbers.

15 = 0 1 1 1 1
– 13 = 2’s complement of 13 = 1 0 0 1 1
Multiplicand (M) = 0 1 1 1 1, Multiplier = 1 0 0 1 1

Leave a Comment