8.1.3 Data representation - Multiplication and division of binary numbers
8.1.3 Data representation - Multiplication and division of binary numbers
Binary multiplication is the process of multiplying binary numbers. The process of multiplying binary
numbers is the same as that of arithmetic multiplication with decimal numbers. The only difference
is that binary multiplication involves numbers that are consist of 0s and 1s, whereas, decimal
multiplication involves numbers that comprise digits from 0 to 9. Let us learn the process of binary
multiplication step by step.
Binary multiplication is similar to the multiplication of decimal numbers. We have a multiplier and a
multiplicand. The result of multiplication results in a product. Since only binary digits are involved in
binary multiplication, we get to multiply only 0s and 1s. The rules for binary multiplication are as
follows.
0 0 0×0=0
0 1 0×1=0
1 0 1×0=0
1 1 1×1=1
The process of multiplying binary numbers is similar and easier to do than decimal multiplication as
binary numbers consist of only two digits which are 0 and 1. The method of multiplying binary
numbers is given below. The same set of rules also apply to binary numbers with a decimal point. Let
us take the example of multiplying (\(11101)_{2}\) and (\(1001)_{2}\). The decimal equivalent of (\
(11101)_{2}\) is 29 and the decimal equivalent of (\(1001)_{2}\) is 9. Now let us multiply these
numbers.
Step 1: Write down the multiplicand (\(11101)_{2}\) and the multiplier (\(1001)_{2}\) one below the
other in proper positions.
Step 2: Multiply the rightmost digit or the least significant bit (LSB) of the multiplier (1) with all the
digits of the multiplicand (\(11101)_{2}\).
Step 3: Add a place holder of '0' or 'X' before multiplying the next higher order digit of the
multiplier& with the multiplicand.
Step 4: Repeat the same process for all the next higher-order digits until we reach the most
significant bit (MSB) which is the left-most digit of the multiplicand with the multiplier.
Step 5: The product obtained in each row is called the partial product. Finally, add all the partial
products. To add all the binary numbers use the rules of binary addition.
(The rules for binary addition are listed as follows: 0 + 0 = 0, 0 + 1 = 1, and 1 + 1 = 0, with a carryover
of 1. So, 1 + 1 = 10 and 1 + 1 + 1 = 11 in the binary number system)
Let us look at the following process of binary multiplication as described above.
Therefore, the product of (\(11101)_{2}\) and (\(1001)_{2}\) is (\(100000101)_{2}\). Let us verify our
answer. The decimal equivalent of (\(100000101)_{2}\) is 261. To know how to convert a binary
number to a decimal number, click here. The decimal equivalent of& (\(11101)_{2}\) is 29 and the
decimal equivalent of (\(1001)_{2}\) is 9. When we multiply 29 and 9 the product is 261. The decimal
equivalent of (\(100000101)_{2}\) is 261. Hence, the product is correct.
Binary Division
Binary division, similar to other binary arithmetic operations, is performed on binary numbers. The
algorithm for binary division is somewhat similar to decimal division, the only difference here lies in
the rules followed using the digits '0' and '1'. Binary multiplication and binary subtraction are the
two binary arithmetic operations that are performed while performing binary division. The use of
only '0' and '1' makes binary division quite simpler in comparison to decimal division. Other
operations that are used while performing binary division are binary multiplication and binary
subtraction.
Binary Division Rules
Binary division problems can be solved by using the long division method, which is one of the most
efficient and easiest ways to divide binary numbers. These are the steps to be followed in a binary
division operation:
Step 1: Compare the divisor with the dividend. If the divisor is larger, place 0 as the quotient,
then bring the second bit of the dividend down. If the divisor is smaller, multiply it with 1 and
the result becomes the subtrahend. Then, subtract the subtrahend from the minuend to get the
remainder.
Step 2: Then bring down the next number bit from the dividend portion and perform step 1
again.
Step 3: Repeat the same process until the remainder becomes zero or the whole dividend is
divided.
Let us understand binary division operation better using the following example:
Step1: Since the zero in the most significant bit position doesn't change the value of the number,
let's remove it from both the dividend and divisor. So the dividend becomes, and the divisor
becomes.
Step 2: Let us use the long-division method. In this step, compare the divisor with the first digit in
the dividend, since the divisor is smaller, it will be multiplied with 1 and the result will be the
subtrahend.
When we apply the above rules, this is how the calculation is done:
For the first digit on the right, we have to subtract (0 - 1). So, we borrow a 1 from the digit on
the left or the next higher order digit. Therefore, the result is 1.
Then, (0 - 0 = 0) since the number in the next higher order digit becomes 0 after borrowing.
1 - 1 = 0 in the second next higher order digit.
So, - =, and this result is written below.
Step 4: As per the rules of division, the next least significant bit comes down, and the divisor is
multiplied by 1. Since the result, is bigger than the minuend, this step cannot be completed. Then,
we have to go to the next step
Step 5: We write 0 as the next bit of the quotient and then, the least significant bit 0 comes down.
Step 6: Again the divisor is multiplied by 1 and the result is written as 101 × 1 =.
Step 7: Now we are at the final step. As per the binary subtraction, we subtract from. We get, - =.
The remainder is similar to Step 3, as all the numbers are the same.
The binary division operation is completed now and we get the following result.
Quotient = \(101-{2}\)
Remainder = 001 = 1