Other Decimal Codes
Binary codes for decimal digits require a minimum of four bits. Numerous different codes can be formulated by arranging four or more bits in 10 distinct possible combinations. A few possibilities are shown in Table 3-6.
These Topics Are Also In Your Syllabus | ||
---|---|---|
1 | Shift Microoperations -arithmetic shift | link |
2 | Shift Microoperations -arithmetic shift | link |
You May Find Something Very Interesting Here. | link | |
3 | Hardware Implementation- shift operator | link |
4 | Arithmetic Logic Shift Unit | link |
5 | Instruction Codes | link |
These Topics Are Also In Your Syllabus | ||
---|---|---|
1 | Shift Microoperations -arithmetic shift | link |
2 | Hardware Implementation- shift operator | link |
You May Find Something Very Interesting Here. | link | |
3 | Arithmetic Logic Shift Unit | link |
4 | Instruction Codes | link |
5 | operation code | link |
The BCD (binary-coded decimal) has been introduced before. It uses a straight assignment of the binary equivalent of the digit. The six unused bit combinations listed have no meaning when BCD is used, just as the letter H has no meaning when decimal digit symbols are written down. For example, saying that 1001 1110 is a decimal number in BCD is like saying that 9H is a decimal number in the conventional symbol designation. Both cases contain an invalid symbol and therefore designate a meaningless number.
self-complementing: One disadvantage of using BCD is the difficulty encountered when the 9's complement of the number is. to be computed. On the other hand, the 9's complement is easily obtained with the 2421 and the excess-3 codes listed self-complementing in Table 3-6. These two codes have a self-complementing property which means that the 9' s complement of a decimal number, when represented in one of these codes, is easily obtained by changing 1's to O's and O's to l's. This property is useful when arithmetic operations are done in signed-complement representation.
weighted code: The 2421 is an example of a weighted code. In a weighted code, the bits are multiplied by the weights indicated and the sum of the weighted bits gives the decimal digit. For example, the bit combination 1101, when weighted by the respective digits 2421, gives the decimal equivalent of 2 x 1 + 4 x 1 + 2 x 0 + 1 + 1 = 7. The BCD code can be assigned the weights 8421 and for this reason it is sometimes called the 8421 code.
These Topics Are Also In Your Syllabus | ||
---|---|---|
1 | Complete Computer Description | link |
2 | Design of Basic Computer | link |
You May Find Something Very Interesting Here. | link | |
3 | Control Logic Gates | link |
4 | Control of Registers and Memory | link |
5 | Control of Single Flip-flops | link |
excess-3 code: The excess-3 code is a decimal code that has been used in older computers. This is an unweighted code. Its binary code assignment is obtained from the corresponding BCD equivalent binary number after the addition of binary 3 (0011).
From Table 3-5 we note that the Gray code is not suited for a decimal code if we were to choose the first 10 entries in the table. This is because the transition from 9 back to 0 involves a change of three bits (from 1101 to 0000). To overcome this difficulty, we choose the 10 numbers starting from the third entry 0010 up to the twelfth entry 1010. Now the transition from 1010 to 0010 involves a change of only one bit. Since the code has been shifted up three numbers, it is called the excess-3 Gray. This code is listed with the other decimal codes in Table 3-6.