Data Coding Theory/Modulo-2 Arithmetic
The modulo operation, commonly expressed as a "%" operator, is a useful operation in data coding. What a modulo is, is the remainder of a division operation between two numbers. For instance, if we divide 10 by 3 and we don't calculate decimal points, we get:
And the remainder would be:
In division, we typically have the equation:
Where s is our dividend, d is our divisor, n is our quotient, and r is the remainder. From this equation, we have two operations:
Notice from these equations that r must always be smaller than d.
Modulo-2 arithmetic is an arithmetic system where every result is taken modulo-2. Here are some examples:
In short, the result of the operation is 1 if the result is odd, and 0 if the result is even. Since we are dealing with individual bits in our data coding, most of our operands will be a 1 or a 0. So long as our operands are 1 or 0, and our results are modulo 2, all the number we write should be 1 or 0.
A common application of modulo-2 arithmetic is in digital circuitry, where logic operations are all performed modulo-2.
In our modulo-2 arithmetic system, we define new operators. These operators are frequently very similar to boolean logical operators, so we will discuss those here too.
- To add two numbers, we take the modulo-2 of the result. Here is a truth table for an add operation:
+ 0 1 0 0 1 1 1 0
- If you are familiar with boolean logic, you will see that addition is identical to the xor operation. Because of this, we will use the terms "add" and "xor" interchangably, and we will denote the modulo-2 addition operation with a "circle-plus":
- Multiplication in modulo 2 happens normally, and no new operator needs to be defined. Here is the truth table for a multiplication operation:
× 0 1 0 0 0 1 0 1
- This is exactly the same as the boolean "and" operation. We will use the words "multiplication" and "and" interchangably.
Subtraction and division operations are rare in data coding, so we won't discuss them here.