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

Lecture # 02 Part B

Digital Logic Design

Uploaded by

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

Lecture # 02 Part B

Digital Logic Design

Uploaded by

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

Digital

Fundamentals
Tenth Edition

Floyd

Chapter 2

© 2008 Pearson Education


Decimal 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 …


Decimal Numbers

Decimal numbers can be expressed as the sum of the products of each


digit times the column value for that digit. Thus, 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 values of each


digit.

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


Binary Numbers

For digital systems, the binary number system is used. Binary 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 …


Decimal Binary
Binary Numbers Number Number

0 000
0
A binary counting sequence for numbers from 1 000
zero to fifteen is shown. 1
2 001
Notice the pattern of zeros and ones in each 0
column. 3 001
Digital counters frequently have this same 1
pattern of digits: 4 010
0
Counter 0 1 0 1 0 1 0 1 0 1 Decoder
5 010
0 0 1 1 0 0 1 1 0 0
1
6 011
0 0 0 0 1 1 1 1 0 0
0
0 0 0 0 0 0 0 0 1 1
7 011
1
8 100
0
Binary 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¼
Binary Conversions

You can convert decimal to any other base by repeatedly dividing by the
base. For binary, repeatedly divide by 2:

Convert the decimal number 49 to binary.

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
Binary Conversions

You can convert a decimal fraction to binary by repeatedly multiplying


the fractional results of successive multiplications by 2. The carries form
the binary number.

Convert the decimal fraction 0.188 to binary by repeatedly


multiplying the fractional results by 2.

MSB
0.188 x 2 = 0.376 carry = 0
0.376 x 2 = 0.752 carry = 0 Most significant bit
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)
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
Binary Addition

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

0111
00111 7
10101 21
11100 = 28
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
10101
/ / / 21
00111 7
01110 = 14
Outline
• 2-1 Decimal Numbers
• 2-2 Binary Numbers
• 2-3 Binary Conversion
• 2-4 Binary Arithmetic
• 2-5 l's and 2's Complements Of Binary Numbers
• 2-6 Signed Numbers
• 2-7 Floating Point Numbers
• 2-8 Arithmetic Operations with Signed Numbers
• 2-9 Hexadecimal Numbers
• 2-10 Octal Numbers
• 2-11 Binary Coded Decimal (BCD)
• 2-12 Digital Codes
• 2-13 Error Detection Codes
1’s Complement

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
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
00110110 (2’s complement)
1 1 0 0 1 0 1 0
1
0 0 1 1 0 1 0 1
Input bits
Carry
Adder
in (add 1)
Output bits (sum)

0 0 1 1 0 1 1 0
Signed Binary Numbers

To represent signed binary numbers, 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)
- 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


Arithmetic Operations with Signed Numbers
Addition
Using the signed number notation with negative numbers in 2’s
complement form simplifies addition and subtraction of signed
numbers.

Rules for addition: Add the two signed numbers.


- Discard any final carries.
- The result is in signed form.

Examples:
00011110 = +30 00001110 = +14 11111111 = -1
00001111 = +15 11101111 = -17 11111000 = -8
00101101 = +45 11111101 = -3 1 11110111 = -9

Discard carry
Arithmetic Operations with Signed Numbers
Addition: Overflow
- Occurs if the number of bits required for the answer is exceeded
- 8 bit signed (-128 ~ 128)
- Occurs only if both numbers have the same sign.
- Indicated by an incorrect sign bit.

Two examples are:


01000000 = +128 10000001 = -127
01000001 = +129 10000001 = -127
10000001 = -126 Discard carry 100000010 = +2

Wrong! The answer is incorrect


and the sign bit has changed.
Arithmetic Operations with Signed Numbers
Subtraction
Rules for subtraction: 2’s complement the subtrahend and add the
numbers. Discard any final carries. The result is in signed form.

Repeat the examples done previously, but subtract:


00011110 (+30) 00001110 (+14) 11111111 (-1)
- 00001111 –(+15) - 11101111 –(-17) - 11111000 –(-8)

2’s complement subtrahend and add:


00011110 = +30 00001110 = +14 11111111 = -1
11110001 = -15 00010001 = +17 00001000 = +8
1 00001111 = +15 00011111 = +31 1 00000111 = +7

Discard carry Discard carry


Outline
• 2-1 Decimal Numbers
• 2-2 Binary Numbers
• 2-3 Binary Conversion
• 2-4 Binary Arithmetic
• 2-5 l's and 2's Complements Of Binary Numbers
• 2-6 Signed Numbers
• 2-7 Floating Point Numbers
• 2-8 Arithmetic Operations with Signed Numbers
• 2-9 Hexadecimal Numbers
• 2-10 Octal Numbers
• 2-11 Binary Coded Decimal (BCD)
• 2-12 Digital Codes
• 2-13 Error Detection Codes
Hexadecimal Numbers Decimal Hexadecimal Binary
0 0 0000
1 1 0001
uses 16 characters to represent numbers:
2 2 0010
- the numbers 0 through 9 and
3 3 0011
- the alphabetic characters A through F
4 4 0100
5 5 0101
6 6 0110
Large binary number can easily be converted
7 7 0111
to hexadecimal by grouping bits 4 at a time
8 8 1000
and writing the equivalent hexadecimal
9 9 1001
character.
10 A 1010
11 B 1011
Express 1001 0110 0000 11102 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
Hexadecimal Numbers Decimal Hexadecimal Binary
0 0 0000
1 1 0001
Hexadecimal is a weighted number system. 2 2 0010
The column weights are powers of 16, which 3 3 0011
increase from right to left. 4 4 0100
5 5 0101
6 6 0110
{
163 162 161 160 .
Column weights 4096 256 16 1 .
7
8
7
8
0111
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
Octal Numbers Decimal Octal Binary
0 0 0000
uses eight characters the numbers 0 through 7 1 1 0001
to represent numbers. There is no 8 or 9 2 2 0010
character in octal. 3 3 0011
4 4 0100
Binary number can easily be converted to octal 5 5 0101
by grouping bits 3 at a time and writing the 6 6 0110
equivalent octal character for each group. 7 7 0111
8 10 1000
9 11 1001
10 12 1010
Express 1 001 011 000 001 1102 in
11 13 1011
octal: 12 14 1100
Group the binary number by 3-bits 13 15 1101
starting from the right. Thus, 14 16 1110
1130168 15 17 1111
Octal Numbers Decimal Octal Binary
0 0 0000
1 1 0001
Octal is also a weighted number system. The 2 2 0010
column weights are powers of 8, which 3 3 0011
increase from right to left. 4 4 0100
5 5 0101
6 6 0110
{
83 8 2 8 1 8 0 .
Column weights 512 64 8 1 .
7
8
7
10
0111
1000
9 11 1001
Express 37028 in decimal. 10 12 1010
11 13 1011
Start by writing the column weights:
12 14 1100
512 64 8 1
13 15 1101
3 7 0 28
14 16 1110
3(512) + 7(64) +0(8) +2(1) = 198610 15 17 1111
Outline
• 2-1 Decimal Numbers
• 2-2 Binary Numbers
• 2-3 Binary Conversion
• 2-4 Binary Arithmetic
• 2-5 l's and 2's Complements Of Binary Numbers
• 2-6 Signed Numbers
• 2-7 Floating Point Numbers
• 2-8 Arithmetic Operations with Signed Numbers
• 2-9 Hexadecimal Numbers
• 2-10 Octal Numbers
• 2-11 Binary Coded Decimal (BCD)
• 2-12 Digital Codes
• 2-13 Error Detection Codes
Binary Coded Decimal (BCD) Decimal Binary BCD
0 0000 0000
What: 1 0001 0001
• a way to express each of the decimal digits 2 0010 0010
with a binary code. 3 0011 0011
• each decimal digit, 0 through 9, is 4 0100 0100
represented by a 4-bit binary code 5 0101 0101
• codes 1010 through 1111 not used
6 0110 0110
Why: 7 0111 0111
It is very easy to convert between decimal and 8 1000 1000
BCD. Because we like to read and write in 9 1001 1001
decimal, the BCD code provides an excellent 10 1010 0001 0000
interface to binary systems. 11 1011 0001 0001
How: 12 1100 0001 0010
13 1101 0001 0011
Examples - interfaces are keypad inputs and 14 1110 0001 0100
digital readouts
15 1111 0001 0101
Binary Coded Decimal (BCD)

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
BCD Addition discussed
BCD in the Lab
ASCII –
American Standard Code for Information Interchange

an 8-bit code for alphanumeric characters and control characters.

Alphanumeric characters: abcd, 1234


Control characters: Null character, backspace, Cancel
ASCII
Outline
• 2-1 Decimal Numbers
• 2-2 Binary Numbers
• 2-3 Binary Conversion
• 2-4 Binary Arithmetic
• 2-5 l's and 2's Complements Of Binary Numbers
• 2-6 Signed Numbers
• 2-7 Floating Point Numbers
• 2-8 Arithmetic Operations with Signed Numbers
• 2-9 Hexadecimal Numbers
• 2-10 Octal Numbers
• 2-11 Binary Coded Decimal (BCD)
• 2-12 Digital Codes
• 2-13 Error Detection Codes
Parity Method
Parity Method

Transmission error happens

Sender Receiver

0101 0101 
1101 1100 
The parity method is a method of error detection for simple
transmission errors involving one bit (or an odd number of bits).
A parity bit is an “extra” bit attached to a group of bits to force the
number of 1’s to be either even (even parity) or odd (odd parity).
Parity Method

Sender Receiver

Parity bit

01010 01010 
Even parity
11011 11001 
01011 01011 
Odd parity
11010 11000 
Selected Key Terms

Byte A group of eight bits


Floating-point A number representation based on scientific notation in
number which the number consists of an exponent and a mantissa.

Hexadecimal A number system with a base of 16.


Octal A number system with a base of 8.
BCD Binary coded decimal; a digital code in which each of the
decimal digits, 0 through 9, is represented by a group of four
bits.
Selected Key Terms

Alphanumeric Consisting of numerals, letters, and other


characters
ASCII American Standard Code for Information
Interchange; the most widely used alphanumeric
code.
Parity In relation to binary codes, the condition of
evenness or oddness in the number of 1s in a code
group.

You might also like