Binary Multiplication
§Binary Multiplication :
process of Multiplying binary numbers.
Rules :
| product | ||||
|---|---|---|---|---|
| 0 | * | 0 | = | 0 |
| 0 | * | 1 | = | 0 |
| 1 | * | 0 | = | 0 |
| 1 | * | 1 | = | 1 |
Steps : 11101 * 1001 =?
29 * 9 =? i.e., 11101 = 29 and 1001 = 9
1.write down the multiplicand (11101) & the Multiplier (1001) one below.
2.Multiply the right most digit or the Least Significant Bit of the Multiplier (1) with all the digits of the multiplicand(11101)
//Binary Multiplication of 11101 - 1001
1 1 1 0 1
* 1 0 0 1
-----------------
1 1 1 0 1
⊗
3.Add a place holder any symbol ,before Multiplying next higher order digit of the Multiplier
4.Repeat the same process for all the digits in the Multiplier until we reach the MSB (Most Significant Bit) or left most digits
5.The product obtained in each row is called partial product.Finally we add all the partial products.To add all the binary numbers use the rules of binary addition.
//Binary Multiplication
1 1 1 0 1 // <- Multiplicand
* 1 0 0 1 // <- Multiplier
----------------------
1 1 1 0 1
0 0 0 0 0 ⊗
0 0 0 0 0 ⊗ ⊗
1 1 1 0 1 ⊗ ⊗ ⊗
+
------------------------------------
1 0 0 0 0 0 1 0 1 // <- Final Result
The product of (11101)2 & (1001)2 is (100000101)2
Answer: 29 * 9 =261
(100000101)2 = 26110