OCTAL AND HEXADECIMAL NUMBER CONVERSION -2




Table 3-1 lists a few octal numbers and their representation in registers in binary-coded form. The binary code is obtained by the procedure explained above. Each octal digit is assigned a 3-bit code as specified by the entries of the first eight digits in the table.Similarly, Table 3-2 lists a few hexadecimal numbers and their representation in registers in binary-coded form. Here the binary code is obtained by assigning to each hexadecimal digit the 4-bit code listed in the first 16 entries of the table. 

OCTAL AND HEXADECIMAL NUMBER CONVERSION -2

 

 

Topics You May Be Interested In
Conversion - Introduction Floating-point Representation
Fixed-point Representation Memory Transfer
Arithmetic Subtraction Hardware Implementation - Selective Set
Overflow Instruction Cycle
Flow Control Add To Ac

 

 

 

 

Topics You May Be Interested In
Octal And Hexadecimal Number Conversion Floating-point Representation
Alphanumeric Representation Error Detection Codes
Subtraction Of Unsigned Numbers-2 Binary Lncrementer
Fixed-point Representation Hardware Implementation - Selective Set
Overflow Common Bus System-memory Address

 

 

 

 

Topics You May Be Interested In
Octal And Hexadecimal Number Conversion Error Detection Codes
Subtraction Of Unsigned Numbers Register Transfer Language
Subtraction Of Unsigned Numbers-2 Memory Transfer
Floating-point Representation Instruction Codes
Floating-point Representation Timing And Control -2

 

 

 

 

Topics You May Be Interested In
Data Types Register Transfer Language
Number System Register Transfer Language -2
Octal And Hexadecimal Number Conversion Shift Micro-operations - Logical, Circular, Arithmetic Shifts
Subtraction Of Unsigned Numbers-2 Common Bus System
Error Detection Codes Memory-reference Instructions

 

 

 

Comparing the binary-coded octal and hexadecimal numbers with their binary number equivalent we find that the bit combination in all three representations is exactly the same. For example, decimal 99, when converted to binary, becomes llOOOII. The binary-coded octal equivalent of decimal 99 is 001 100 Oll and the binary-coded hexadecimal of decimal 99 is 0110 OOll. If we neglect the leading zeros in these three binary representations, we find that their bit combination is identicaL This should be so because of the straightforward conversion that exists between binary numbers and octal or hexadecimaL The point of all this is that a string of 1's and O's stored in a register could represent a binary number, but this same string of bits may be interpreted as holding an octal number in binary-coded form (if we divide the bits in groups of three) or as holding a hexadecimal number in binary-coded form (if we divide the bits in groups of four).

Topics You May Be Interested In
Conversion - Introduction Register Transfer -2
Introduction To Decimal Representation List Of Logic Microoperations
Floating-point Representation Computer Instructions
Floating-point Representation Timing And Control
Other Alphanumeric Codes And To Ac

The registers in a digital computer contain many bits. Specifying the content of registers by their binary values will require a long string of binary digits. It is more convenient to specify content of registers by their octal or hexadecimal equivalent. The number of digits is reduced by one-third in the octal designation and by one-fourth in the hexadecimal designation. For example, the binary number 1111 1111 1111 has 12 digits. It can be expressed in octals as 7777 (four digits) or in hexadecimal as FFF (three digits). Computer manuals invariably choose either the octal or the hexadecimal designation for specifying contents of registers.



Frequently Asked Questions

+
Ans: The conversion from and to binary, octal, and hexadecimal representation plays an important part in digital computers. Since 23 = 8 and 24 = 16, each octal digit corresponds to three binary digits and each hexadecimal digit corresponds to four binary digits. view more..
+
Ans: Conversion from decimal to its equivalent representation in the radix r system is carried out by separating the number into its integer and fraction parts and converting each part separately. view more..
+
Ans: A number system of base, or radix, r is a system that uses distinct symbols for r digits. Numbers are represented by a string of digit symbols. To determine the quantity that the number represents, it is necessary to multiply each digit by an integer power of r and then form the sum of all weighted digits. view more..
+
Ans: Table 3-1 lists a few octal numbers and their representation in registers in binary-coded form. The binary code is obtained by the procedure explained above. Each octal digit is assigned a 3-bit code as specified by the entries of the first eight digits in the table view more..
+
Ans: The binary number system is the most natural system for a computer, but people are accustomed to the decimal system. One way to solve this conflict is to convert all input decimal numbers into binary numbers, let the computer perform all arithmetic operations in binary and then convert the binary results back to decimal for the human user to understand. view more..
+
Ans: Many applications of digital computers require the handling of data that consist not only of numbers, but also of the letters of the alphabet and certain special characters view more..
+
Ans: Complements are used in digital computers for simplifying the subtraction operation and for logical manipulation. There are two types of complements for each base r system: the r's complement and the (r - l)'s complement. view more..
+
Ans: The r's complement of an n-digit number N in base r is defined as r' - N for N * D and D for N = D. Comparing with the (r - I)'s complement, we note that the r's complement is obtained by adding I to the (r - I)'s complement since r' - N = [(r' - I) - N] + I. view more..
+
Ans: The direct method of subtraction taught in elementary schools uses the borrow concept. In this method we borrow a 1 from a higher significant position when the minuend digit is smaller than the corresponding subtrahend digit. view more..
+
Ans: Since we are dealing with unsigned numbers, there is really no way to get an unsigned result for the second example. view more..
+
Ans: Positive integers, including zero, can be represented as unsigned numbers. However, to represent negative integers, we need a notation for negative values. In ordinary arithmetic, a negative number is indicated by a minus sign and a positive number by a plus sign. view more..
+
Ans: When an integer binary number is positive, the sign is represented by 0 and the magnitude by a positive binary number. When the number is negative, the sign is represented by 1 but the rest of the number may be represented in one of three possible ways: view more..
+
Ans: The addition of two numbers in the signed-magnitude system follows the rules of ordinary arithmetic. If the signs are the same, we add the two magnitudes and give the sum the common sign. If the signs are different, we subtract the smaller magnitude from the larger and give the result the sign of the larger magnitude. view more..
+
Ans: Subtraction of two signed binary numbers when negative numbers are in 2' s complement form is very simple and can be stated as follows: Take the 2's complement of the subtrahend (including the sign bit) and add it to the minuend (including the sign bit). A carry out of the sign bit position is discarded. view more..
+
Ans: When two numbers of n digits each are added and the sum occupies n + 1 digits, we say that an overflow occurred. When the addition is performed with paper and pencil, an overflow is not a problem since there is no limit to the width of the page to write down the sum. view more..
+
Ans: An overflow condition can be detected by observing the carry into the sign bit position and the carry out of the sign bit position. If these two carries are not equal, an overflow condition is produced. view more..
+
Ans: The representation of decimal numbers in registers is a function of the binary code used to represent a decimal digit. A 4-bit decimal code requires four flip-flops for each decimal digit. 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..




Rating - 4/5
544 views

Advertisements