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.

Other Decimal Codes

 

 

Topics You May Be Interested In
Complements Binary Adder-subtractor
Floating-point Representation Instruction Codes
Other Decimal Codes Computer Instructions
Register Transfer Instruction Set Completeness
Memory Transfer Bsa: Branch And Save Return Address -subroutine Call

 

 

 

 

Topics You May Be Interested In
Introduction To Decimal Representation Bus And Memory Transfers
Complements Stored Program Organization
Arithmetic Subtraction Computer Instructions
Error Detection Codes-2 Timing And Control
Register Transfer -2 Fetch And Decode

 

 

 

 

Topics You May Be Interested In
Conversion - Introduction Stored Program Organization
Overflow Common Bus System
Floating-point Representation Instruction Cycle
Register Transfer Language Memory-reference Instructions
Register Transfer Language -2 Add To Ac

 

 

 

 

Topics You May Be Interested In
Octal And Hexadecimal Number Conversion -2 Error Detection Codes
Introduction To Decimal Representation Binary Adder
Fixed-point Representation Binary Adder-subtractor
Floating-point Representation Some Applications Hardware Implemntation
Other Alphanumeric Codes Common Bus System

 

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.

Topics You May Be Interested In
Conversion - Introduction List Of Logic Microoperations
Alphanumeric Representation Shift Micro-operations - Logical, Circular, Arithmetic Shifts
Overflow Operation Code
Error Detection Codes Timing And Control -2
Error Detection Codes-2 Add To Ac

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.



Frequently Asked Questions

+
Ans: In previous sections we introduced the most common types of binary-coded data found in digital computers. Other binary codes for decimal numbers and alphanumeric characters are sometimes used. Digital computers also employ other binary codes for special applications. A few additional binary codes encountered in digital computers are presented in this section. view more..
+
Ans: A floating-point number is said to be normalized if the most significant digit of the mantissa is nonzero. For example, the decimal number 350 is normalized but 00035 is not. Regardless of where the position of the radix point is assumed to be in the mantissa, the number is normalized only if its leftmost digit is nonzero. view more..
+
Ans: The floating-point representation of a number has two parts. The first part represents a signed, fixed-point number called the mantissa. The second part designates the position of the decimal (or binary) point and is called the exponent. The fixed-point mantissa may be a fraction or an integer. For exam ple, the decimal number +6132.789 is represented in floating-point with a fraction and an exponent as follows: view more..
+
Ans: 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. view more..
+
Ans: The ASCII code (Table 3-4) is the standard code commonly used for the transmission of binary information. Each character is represented by a 7-bit code and usually an eighth bit is inserted for parity (see Sec. 3-6). The code consists of 128 characters. Ninety-five characters represent graphic symbols that include upper- and lowercase letters, numerals zero to nine, punctuation marks, and special symbols view more..
+
Ans: Binary information transmitted through some form of communication medium is subject to external noise that could change bits from 1 to 0, and vice versa. An error detection code is a binary code that detects digital errors during transmission. The detected errors cannot be corrected but their presence is indicated. The usual procedure is to observe the frequency of errors. If errors occur infrequently at random, the particular erroneous information is transmitted again. If the error occurs too often, the system is checked for malfunction view more..
+
Ans: Parity generator and checker networl<s are logic circuits constructed with exclusive-OR functions. This is because, as mentioned in Sec. 1·2, the exclusive-OR function of three or more varia.bles is by definition an odd function. An odd function is a logic function whose value is binary 1 if, and only if, an odd function number of variables are equal to 1. According to this definition, the P( even) is the exclusive-OR of x, y, and l because it is equal to 1 when either one or all three of the variables are equal to I (Table 3-7). The P(odd) function is the complement of the P(even) function. view more..
+
Ans: A digital system Is an interconnection of digital hardware module. that at'ClOinpl.lsh a specific Wormation-proceaslna taslc. Digital systems vary in size and complexi.ty interacting digital &om a few integrated circuits to a complex of interconnected and computers. Digital system design invariably UBeS a modular approach. The modules are constructed &om such digital components as ules registet&, are in decoders, terconnected arithmetic with common elements data and control paths , and control logic. The to fonn various moda digital computer system. view more..
+
Ans: The symbolic notation used to describe the microoperation transfers among registers is called a register transfer language. The term "register transfer" implies the availability of hardware logic circuits that can perform a stated microoperation and transfer the result of the operation to the same or another register. view more..
+
Ans: Computer registers are designated by capital letters (sometimes followed by numerals) to denote the function of the register. For example, the register that holds an address for the memory unit is usually called a memory address register and is designated by the name MAR. view more..
+
Ans: where P is a control signal generated in the control section. It is sometimes convenient to separate the control variables from the register transfer operation by specifying a control function. view more..
+
Ans: A typical digital computer has many registers, and paths must be provided to transfer information from one register to another. The number of wires will be excessive if separate lines are used between each register and all other registers in the system. view more..
+
Ans: The two selection lines S1 and S0 are connected to the selection inputs of all four multiplexers. The selection lines choose the four bits of one register and transfer them into the four-line common bus. When S1S0 = 00, the 0 data inputs of all four multiplexers are selected and applied to the outputs that form the bus view more..
+
Ans: A bus system can be constructed with three-state gates instead of multiplexers. A three-state gate is a digital circuit that exhibits three states. Two of the states are signals equivalent to logic 1 and 0 as in a conventional gate. The third state is a high-impedance state. view more..
+
Ans: The operation of a memory unit was described in Sec. 2-7. The transfer of information from a memory word to the outside environment is called a read operation. view more..
+
Ans: To implement the add microoperation with hardware, we need the registers that hold the data and the digital component that performs the arithmetic addition. The digital circuit that forms the arithmetic sum of two bits and a previous carry is called a full-adder . view more..
+
Ans: The subtraction of binary numbers can be done most conveniently by means of complements as discussed in Sec. 3-2. Remember that the subtraction A - B can be done by taking the 2's complement of B and adding it to A. The 2's complement can be obtained by taking the 1' s complement and adding one to the least significant pair of bits. The 1's complement can be implemented with inverters and a one can be added to the sum through the input carry. view more..
+
Ans: The increment microoperation adds one to a number in a register. For example, if a 4-bit register has a binary value 0110, it will go toO! II afterit is incremented. This microoperation is easily implemented with a binary counter view more..




Rating - 3/5
457 views

Advertisements