0% found this document useful (0 votes)
8 views

Chapter_two (2)

Chapter Two of the Digital Logic Design document covers various number systems including decimal, binary, octal, and hexadecimal, along with their operations and digital codes. It explains the representation, conversion methods, and arithmetic operations for these number systems. The chapter also discusses signed binary numbers and complements, providing examples and rules for binary addition and subtraction.

Uploaded by

kyared054
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Chapter_two (2)

Chapter Two of the Digital Logic Design document covers various number systems including decimal, binary, octal, and hexadecimal, along with their operations and digital codes. It explains the representation, conversion methods, and arithmetic operations for these number systems. The chapter also discusses signed binary numbers and complements, providing examples and rules for binary addition and subtraction.

Uploaded by

kyared054
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Digital Logic Design

Chapter Two
Number systems, operations
and codes
School of Electrical and Computer Engineering

Instructor: Dr. Tamiru Debela


17 Dec, 2024
Outline

1. Decimal number system


2. Binary number system and operation
3. Octal number system
4. Hexadecimal number system
5. Digital codes

Chapter 2 | Number systems, operations and codes Year II, Sem I 1


1. Decimal Numbers
▪ Decimal digits are those count from 0 to 9 (i.e. 0,1,2,…,9)
▪ By combining these ten digits we can express different numbers
▪ The position of each digit in a weighted number system is assigned
a weight based on the base or radix of the system.
▪ The radix of decimal numbers is ten, because only ten symbols (0
through 9) are used to represent any number.
✓ The column weights of decimal numbers are powers of ten that
increase from right to left beginning with 100 = 1:
…105 104 103 102 101 100.
✓ For fractional decimal numbers, the column weights are negative
powers of ten that decrease from left to right:
102 101 100. 10-1 10-2 10-3 10-4 …

Chapter 2 | Number systems, operations and codes Year II, Sem I 2


Cont…
▪ Decimal number representation can be expressed as:
✓ the sum of the products of each digit times the column value for that
digit.
▪ For example, the number 9240 can be expressed as:
(9 x 103) + (2 x 102) + (4 x 101) + (0 x 100)
or
9 x 1,000 + 2 x 100 + 4 x 10 + 0 x 1

Express the number 480.52 as the sum of the values of


each digit.

480.52 = (4 x 102) + (8 x 101) + (0 x 100) + (5 x 10-1) +(2 x 10-2)

Chapter 2 | Number systems, operations and codes Year II, Sem I 3


2. Binary Numbers

▪ All digital systems, use the binary number system.

▪ Binary number system has a radix of two and uses the digits 0
and 1 to represent quantities.

✓ The column weights of binary numbers are powers of two that


increase from right to left beginning with 20 =1:

…25 24 23 22 21 20.

✓ For fractional binary numbers, the column weights are negative


powers of two that decrease from left to right:

22 21 20. 2-1 2-2 2-3 2-4 …

Chapter 2 | Number systems, operations and codes Year II, Sem I 4


Decimal Binary
Number Number
Cont…
0 0000
▪ A binary counting sequence for numbers 1 0001
from zero to fifteen is shown. 2 0010
3 0011
▪ Notice the pattern of zeros and ones in 4 0100
each column. 5 0101
6 0110
▪ Digital counters frequently have this 7 0111
same pattern of digits: 8 1000
9 1001
Counter 0 1 0 1 0 1 0 1 0 1 Decoder
10 1010
0 0 1 1 0 0 1 1 0 0
11 1011
12 1100
0 0 0 0 1 1 1 1 0 0
13 1101
0 0 0 0 0 0 0 0 1 1
14 1110
15 1111

Chapter 2 | Number systems, operations and codes Year II, Sem I 5


🖛 Decimal-to-Binary Conversion
▪ A decimal whole number can be converted to binary by using sum of
weights method.
i. Write the decimal weight of each column until the last number is larger
than the given number.
ii. Place 1’s in the columns that sum to the given decimal number.

Convert the decimal number 49 to binary.

Write down column weights until the last number is


larger than the one you want to convert.

26 25 24 23 22 21 20.
64 32 16 8 4 2 1.
0 1 1 0 0 0 1.

Chapter 2 | Number systems, operations and codes Year II, Sem I 6


Cont…
▪ A decimal fraction can be converted to binary by:
✓ Repeatedly multiplying the fractional results of successive
multiplications by 2 until the fractional product is zero.

▪ The quotient produces the binary number with the first quotient is
the MSB.
Convert the decimal fraction 0.188 to binary by repeatedly
multiplying the fractional results by 2 until 5 significant
figures.

0.188 x 2 = 0.376 carry = 0 MSB


0.376 x 2 = 0.752 carry = 0
0.752 x 2 = 1.504 carry = 1
0.504 x 2 = 1.008 carry = 1
0.008 x 2 = 0.016 carry = 0
Answer = .00110 (for five significant digits)

Chapter 2 | Number systems, operations and codes Year II, Sem I 7


Cont…
▪ A whole decimal number can also be converted to binary by:
✓ Repeatedly dividing the number by the base (2) until there is a zero
quotient.
▪ The remainders produce the binary number with the 1st remainder
is LSB
Convert the decimal number 49 to binary by repeatedly
dividing by 2.

You can do this by “reverse division” and the answer will


read from left to right. Put quotients to the left and
remainders on top.

Answer: 1 1 0 0 0 1 remainder
0 1 3 6 12 24 49 2
Continue until the Decimal
Quotient base
last quotient is 0 number

Chapter 2 | Number systems, operations and codes Year II, Sem I 8


🖛 Binary-to-Decimal Conversions
▪ The decimal equivalent of a binary number can be determined by

▪ Adding the column values of all of the bits that are 1 and discarding all
of the bits that are 0.

Convert the binary number 100101.01 to decimal.

Start by writing the column weights; then add the weights


that correspond to each 1 in the number.

25 24 23 22 21 20. 2-1 2-2


32 16 8 4 2 1 . ½ ¼
1 0 0 1 0 1. 0 1
32 +4 +1 +¼ = 37.25

Chapter 2 | Number systems, operations and codes Year II, Sem I 9


Binary Arithmetic

➢ Binary Addition

🖛 The rules for binary addition


are 0+0=0 Sum = 0, carry = 0
0+1=1 Sum = 1, carry = 0
1+0=1 Sum = 1, carry = 0
1 + 1 = 10 Sum = 0, carry = 1

🖛 When an input carry = 1 due to a previous result, the rules are

1 + 0 + 0 = 01 Sum = 1, carry = 0
1 + 0 + 1 = 10 Sum = 0, carry = 1
1 + 1 + 0 = 10 Sum = 0, carry = 1
1 + 1 + 1 = 11 Sum = 1, carry = 1

Chapter 2 | Number systems, operations and codes Year II, Sem I 10


Cont…

Add the binary numbers 00111 and 10101 and show the
equivalent decimal addition.

0111
00111 7
10101 21
11100 = 28

Chapter 2 | Number systems, operations and codes Year II, Sem I 11


🖛 Binary Subtraction

The rules for binary subtraction are:

0−0=0
1−1=0
1−0=1
10 − 1 = 1 with a borrow of 1
Subtract the binary number 00111 from 10101 and show
the equivalent decimal subtraction.

111
1/ 0/ 1/ 01
21
00111 7
01110 = 14

Chapter 2 | Number systems, operations and codes Year II, Sem I 12


1’s and 2’s complement of binary numbers
1’s Complement
▪ Complements are used in digital computers to simplify the
subtraction operation and for logical manipulation.
▪ The 1’s complement of a binary number is just the inverse of the
digits.
▪ To form the 1’s complement, change all 0’s to 1’s and all 1’s to 0’s.

▪ For example, the 1’s complement of 11001010 is


00110101
▪ In digital circuits, the 1’s complement is formed by using inverters:
1 1 0 0 1 0 1 0

0 0 1 1 0 1 0 1

Chapter 2 | Number systems, operations and codes Year II, Sem I 13


2’s Complement

▪ The 2’s complement of a binary number is found by adding 1 to the


LSB of the 1’s complement.

Recall that the 1’s complement of 11001010 is


00110101 (1’s complement)

To form the 2’s complement, add 1: +1


1 1 0 0 1 0 1 0 00110110 (2’s complement)
1

0 0 1 1 0 1 0 1
Input bits
Adder Carry
in (add 1)
Output bits (sum)
0 0 1 1 0 1 1 0

Chapter 2 | Number systems, operations and codes Year II, Sem I 14


Signed Binary Numbers
▪ A signed binary number consists both sign and magnitude
▪ There are several ways to represent signed binary numbers.
▪ In all cases, the MSB in a signed number is the sign bit, that tells
you if the number is positive or negative.

✓ Computers use a modified 2’s complement for signed numbers.

✓ Positive numbers are stored in true form (with a 0 for the sign bit)
and negative numbers are stored in complement form (with a 1 for
the sign bit).

For example, the positive number 58 is written using 8-bits as


00111010 (true form).

Sign bit Magnitude bits

Chapter 2 | Number systems, operations and codes Year II, Sem I 15


Cont…

▪ Negative numbers are written as the 2’s complement of the


corresponding positive number.

The negative number −58 is written as:

−58 = 11000110 (complement form)


Sign bit Magnitude bits
▪ An easy way to read a signed number that uses this notation is to
assign the sign bit a column weight of -128 (for an 8-bit number),
then add the column weights for the 1’s.
Assuming that the sign bit = −128, show that 11000110 = −58
as a 2’s complement signed number:
Column weights: −128 64 32 16 8 4 2 1.
1 1 0 0 0 1 1 0
−128 +64 +4 +2 = −58

Chapter 2 | Number systems, operations and codes Year II, Sem I 16


3. Hexadecimal Numbers
▪ Hexadecimal uses sixteen characters to
Decimal Hexadecimal Binary
represent numbers: 0 0 0000
✓ The numbers 0 through 9 and the
1 1 0001
2 2 0010
alphabetic characters A through F. 3 3 0011
▪ Large binary number can easily be 4 4 0100
5 5 0101
converted to hexadecimal by 6 6 0110
▪ Grouping 4 bits at a time starting from 7 7 0111
8 8 1000
LSB and writing the equivalent
9 9 1001
hexadecimal character. 10 A 1010
11 B 1011
Express 10010110000011102 in 12 C 1100
hexadecimal:
13 D 1101
Group the binary number by 4-bits 14 E 1110
starting from the right. Thus, 960E 15 F 1111

Chapter 2 | Number systems, operations and codes Year II, Sem I 20


Cont…
▪ The column weights are powers of 16,
Decimal Hexadecimal Binary
which increase from right to left. 0 0 0000
1 1 0001
▪ It can be converted to decimal by 2 2 0010
3 3 0011
✓ Adding products of each decimal value
4 4 0100
of the hexadecimal digit with its weight 5 5 0101
6 6 0110
7 7 0111
Column weights { 163 162 161 160.
4096 256 16 1 . 8 8 1000
9 9 1001
Express 1A2F16 in decimal. 10 A 1010
11 B 1011
Start by writing the column weights:
12 C 1100
4096 256 16 1
13 D 1101
1 A 2 F16
14 E 1110
1(4096) + 10(256) +2(16) +15(1) = 670310 15 F 1111

Chapter 2 | Number systems, operations and codes Year II, Sem I 21


4. Octal Numbers
▪ Octal uses eight characters the numbers 0 Decimal Octal Binary

through 7 to represent numbers. 0 0 0000


1 1 0001
✓ There is no 8 or 9 character in octal. 2 2 0010
▪ Binary number can easily be converted to 3 3 0011
4 4 0100
octal by 5 5 0101
▪ Grouping 3 bits at a time starting from 6 6 0110
7 7 0111
LSB and writing the equivalent octal
character for each group.

Express 10010110000011102 in
octal:
Group the binary number by 3-bits
starting from the right. Thus, 1130168

Chapter 2 | Number systems, operations and codes Year II, Sem I 22


Cont…
▪ The column weights are powers of 8,
Decimal Octal Binary
which increase from right to left. 0 0 0000
1 1 0001
▪ It can be converted to decimal by adding 2 2 0010
products of each octal digit with its 3 3 0011
4 4 0100
weight. 5 5 0101
6 6 0110
7 7 0111
Column weights { 83 82
512 64
81
8
80 .
1 .

Express 37028 in decimal.

Start by writing the column weights:


512 64 8 1
3 7 0 28
3(512) + 7(64) +0(8) +2(1) = 198610

Chapter 2 | Number systems, operations and codes Year II, Sem I 23


5. Digital Codes
▪ Combination of binary digits that
Decimal Binary BCD
represent numbers, letters and 0 0000 0000
symbols are called digital codes 1 0001 0001
2 0010 0010
3 0011 0011
1. BCD
4 0100 0100
▪ Binary coded decimal (BCD) is a 5 0101 0101
6 0110 0110
weighted code that represents each 7 0111 0111
decimal digits by 4 bit binary code 8 1000 1000
9 1001 1001
✓ The table illustrates the difference 10 1010 00010000
between straight binary and BCD. 11 1011 00010001
✓ In BCD each decimal digit (0 to 9) 12 1100 00010010
are represented with a 4-bit code. 13 1101 00010011
14 1110 00010100
✓ Notice that the codes 1010 through
1111 are not used in BCD. 15 1111 00010101

Chapter 2 | Number systems, operations and codes Year II, Sem I 24


Cont…
▪ You can think of BCD in terms of column weights in groups of four
bits.

▪ For an 8-bit BCD number, the column weights are: 80 40 20 10 8


4 2 1.

What are the column weights for the BCD number


1000 0011 0101 1001?

8000 4000 2000 1000 800 400 200 100 80 40 20 10 8 4 2 1


Note that you could add the column weights where there is a 1
to obtain the decimal number. For this case:
8000 + 200 +100 + 40 + 10 + 8 +1 = 835910

Chapter 2 | Number systems, operations and codes Year II, Sem I 25


🖛 Rules for BCD Addition
i. Add the two BCD numbers using the rule for addition
ii. If a 4-bit sum is equal to or less than 9, it is a valid BCD number
iii. If the sum is greater than 9 or if a carry out is generated, it is an
invalid result so that, add 6(0110) to the invalid sum
iv. If a carry out results when 6 is added, add the carry to the next 4-bit
group

Chapter 2 | Number systems, operations and codes Year II, Sem I 26


Cont…

Chapter 2 | Number systems, operations and codes Year II, Sem I 27


Chapter 2 | Number systems, operations and codes Year III, Sem II 35

You might also like