Professional Documents
Culture Documents
1
Decimal Numbers
2
Binary Numbers
Decimal Binary Number Decimal Binary Number
Number Number
0 0 0 0 0 8 1 0 0 0
1 0 0 0 1 9 1 0 0 1
2 0 0 1 0 10 1 0 1 0
3 0 0 1 1 11 1 0 1 1
4 0 1 0 0 12 1 1 0 0
5 0 1 0 1 13 1 1 0 1
6 0 1 1 0 14 1 1 1 0
7 0 1 1 1 15 1 1 1 1
3
Binary – to – Decimal Conversion
Convert the binary whole number 1101 101 to
decimal
Weight : 26 25 24 23 22 21 20
Binary number: 1 1 0 1 1 0 1
1101101 = 26+25+24+23+22+21+20
= 64+32+8+4+1
= 109
4
Decimal – to – Binary Conversion
Sum – of – Weight Method
Solution :
9 = 8 + 1 or 9 = 2 + 2
3 0 23 22 21 20
1 0 0 1
5
Decimal – to – Binary Conversion
Repeated Division – by – 2 Method
MSB – most
significant bit
LSB – least
significant bit
6
Binary Arithmetic
Binary addition
The four basic rules for adding binary digits
(bits) are as follows:
7
Binary Arithmetic
Binary addition - Example
Carry Carry
1 1
0 0 1
+0 0 1
1 0 0
8
Binary Arithmetic
Binary addition - Example
Carry bits
9
Binary Arithmetic
Binary Subtraction
The four basic rules for subtracting bits are as
follows:
1–1 =0
1–0 =1
10 – 1 = 1 0 – 1 with a borrow of 1
10
Binary Arithmetic
Binary Multiplication
The four basic rules for multiplying bits are as
follows:
0x0=0
0x1=0
1x0=0
1x1=1
11
Binary Arithmetic
Binary Division
12
1’s Complement of Binary Numbers
The 1’s complements is important because it
permits the representation of negative
numbers.
The 1’s complement of a binary number is
found by changing all 1s to 0s and all 0s to 1s.
13
1’s Complement of Binary Numbers
Application example
Simplest way is to use parallel inverters.
14
2’s Complement of Binary Numbers
Is found by adding1 to the LSB of the
1’s complement.
16
Signed Numbers
Digital systems, such as the computers, must
be able to handle both positive and negative
numbers.
A signed binary numbers consist of both sign
and magnitude information.
The sign indicates whether a number is positive
or negative and the magnitude is the value of
the number.
Three forms in which integer number can be
represented in binary.
17
Signed Numbers
Sign Bit
18
Signed Numbers
Sign – Magnitude Form
The left – most bit is the sign bit and the
remaining bits are the magnitude bits.
Example : + 25 00011001
Example : - 25 10011001
Sign bit Magnitude bits
19
Signed Numbers
1’s Complement Form
20
Signed Numbers
2’s Complement Form
21
The Decimal Value of Signed
Numbers
Sign – magnitude
22
The Decimal Value of Signed
Numbers
1’s complement
23
The Decimal Value of Signed
Numbers
2’s Complement
24
Arithmetic Operations with Signed
Numbers
Addition
Two numbers in addition are the addend and the
augend.
Result is the sum.
Four cases can occur when two signed binary
numbers are added.
1. Both numbers positive
2. Positive numbers with magnitude larger than
negative number.
3. Negative number with magnitude larger than
positive number.
4. Both numbers negative.
25
Arithmetic Operations with Signed
Numbers
Subtraction
Special case of addition
For example, subtracting +6 (subtrahend)
from +9 (minuend) is equivalent to adding -
6 to +9.
Subtraction operation changes the sign of
the subtrahend and adds it to minuend.
The result is called the difference.
26
Arithmetic Operations with Signed
Numbers
Subtraction – cont..
27
Arithmetic Operations with Signed
Numbers
Multiplication
28
Hexadecimal Numbers
Has sixteen digits and is used primarily as a
compact way of displaying or writing binary
numbers because it is very easy to convert
between binary and hexadecimal.
It is composed of sixteen digits and alphabetic
characters.
The hexadecimal number system consist of
digits 0 – 9 and letters A – F.
29
Hexadecimal Numbers
Decimal Binary Hexadecimal Decimal Binary Hexadecimal
0 0000 0 8 1000 8
1 0001 1 9 1001 9
2 0010 2 10 1010 A
3 0011 3 11 1011 B
4 0100 4 12 1100 C
5 0101 5 13 1101 D
6 0110 6 14 1110 E
7 0111 7 15 1111 F
30
Binary – to – Hexadecimal
Conversion
Simply break the binary number into 4 – bit
groups, starting the right – most bit and
replace each 4 – bit group with the equivalent
hexadecimal symbol.
Example : 1100101001010111
31
Hexadecimal – to – Binary
Conversion
Reverse the process of Binary – to –
Hexadecimal and replace each hexadecimal
symbol with appropriate four bits.
Example : 10A416
1 0 A 4
1 0000 1010 0100
32
Hexadecimal – to – decimal
Conversion
Convert hexadecimal number to binary number first,
then convert from binary to decimal.
Hexadecimal to binary: 1 C
0001 1100
Binary to decimal: 24 23 22 21 20
1 1 1 0 0
16+8+4=2810
33
Hexadecimal – to – decimal
Conversion
Another way : multiply the decimal value of each
hexadecimal digit by its weight and then take the
sum of the products.
34
Decimal – to Hexadecimal
Conversion
Repeated division of a decimal number by 16
Example : 650 decimal to hexadecimal
35
Hexadecimal Addition
Rules :
1. In any given column of an addition problem,
think of the two hexadecimal digits in term of
their decimal values. Example, 516 = 510 and
C16 = 1210
2. If the sum of these two digits is 15 10 or less,
bring down the corresponding hexadecimal
digit.
3. If the sum of these two digits is greater than
1510, bring down the amount of the sum that
exceeds 1610 and carry 1 to the next column.
36
Hexadecimal Addition
Example :
37
18B16
Hexadecimal Subtraction
Method 1
38
Hexadecimal Subtraction
Method 2
39
Hexadecimal Subtraction
Method 3
40
Octal Numbers
Composed of eight digits which are
0, 1, 2, 3, 4, 5, 6, 7
41
Octal – to – Decimal Conversion
Example : 23748
Weight : 83 82 81 80
Octal number: 2 3 7 4
42
Decimal – to – Octal Conversion
43
Octal – to – Binary Conversion
Octal Digit 0 1 2 3 4 5 6 7
1 3
001 011
44
Binary – to – Octal Conversion
Reverse process of octal – to – binary
conversion.
110 101
6 5
45
Gray Code
Unweighted and is not an arithmetic code; that
is, there are no specific weights assigned to the
bit position.
Important feature : it exhibits only a single bit
change from one code word to the next
sequence.
46
Gray Code
Decimal Binary Gray code Decimal Binary Gray code
47
Binary – to – Gray Code Conversion
Rules :
The most significant bit (left – most) in the Gray code is
the same as the corresponding MSB in the binary
number.
Going from left to right, add each adjacent pair of binary
code bits to get the next Gray code bit. Discard
carries.
Example : 10110 to gray code. (11101)
48
Gray – to – Binary Conversion
Rules :
The most significant bit (left – most) in the binary code
is the same as the corresponding bit in the Gray code.
Add each binary code bit generated to the Gray code bit
in the next adjacent position. Discard carries.
Example : gray code word 11011 to binary
49
ASCII
Abbreviation for American Standard Code for
Information Interchange.
Pronounced as ‘askee’.
Universally accepted alphanumeric code used in the
most computers and other electronic equipment,
Most computer keyboards are standardized with the
ASCII.
Example : when enter a letter, number, or control
command, corresponding ASCII code goes into
computer.
50
ASCII
Has 128 characters and symbols represented by a 7 –
bit binary code.
It can be considered an 8 – bit code with MSB always 0.
8 – bit code is 00 through 7F in hexadecimal.
The first 32 ASCII characters are nongraphic commands
that are never printed on displayed and are used only for
control purposes.
Example : null, line feed, start of text, and escape.
The other characters are graphic symbols that can be
displayed and printed and include letters, numbers, ten
decimal digits, punctuation signs, and other commonly
used symbols.
51