Scribd
Upload
96 views43 pages

Chapter 3 - Introduction To Digital Systems

Uploaded by

Mohamed Shehadi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
96 views43 pages

Chapter 3 - Introduction To Digital Systems

Uploaded by

Mohamed Shehadi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 43

MCHE 514:

Programmable Logic Controllers


Chapter 3. Introduction to Digital
Systems

Instructor: Mohamad Darwiche, PhD.


3. Digital Systems Outlines

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 2


3.1 Combinational & Sequential Logic
i. Basic Logic Components

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 3


3.1 Combinational & Sequential Logic
ii. Combinational and Sequential Circuits

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 4


3.1 Combinational & Sequential Logic
iii. Boolean Algebra and Logic Gates

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 5


3.1 Combinational & Sequential Logic
iV Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 6


3.1 Combinational & Sequential Logic
iV Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 7


3.2 Logic Gates
3.2.1 “NOT” Logic Gates

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 8


3.2 Logic Gates
3.2.2 “AND” Logic Gates

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 9


3.2 Logic Gates
3.2.3 “OR” Logic Gates

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 10


3.2 Logic Gates
3.2.4 “NAND” Logic Gate

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 11


3.2 Logic Gates
3.2.5 “NOR” Logic Gate

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 12


3.2 Logic Gates
3.2.6 “EX-OR & EX-NOR” Logic Gate

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 13


3.2 Logic Gates
Example 1

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 14


3.2 Logic Gates
Example 1

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 15


3.2 Logic Gates
iV Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 16


3.2 Logic Gates
Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 17


3.2 Logic Gates
Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 18


3.2 Logic Gates
Boolean Algebra

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 19


3.2 Logic Gates
Example 2

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 20


3.2 Logic Gates
Example 2

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 21


3.2 Logic Gates
Example 3

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 23


3.2 Logic Gates
Example 4

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 24


3.2 Logic Gates
Example 4

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 25


3.2 Logic Gates
Example 5

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 26


3.2 Logic Gates
Example 5

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 27


3.2 Logic Gates
Karnaugh map
Karnaugh map is a method use to simplify logic expressions
• Simplification of logic expression using Boolean algebra is awkward because:
• it lacks specific rules to predict the most suitable next step in the
simplification process
• it is difficult to determine whether the simplest form has been achieved.
• A Karnaugh map is a graphical method used to obtained the most simplified
form of an expression in a standard form (Sum-of-Products or Product-of-
Sums).
• The simplest form of an expression is the one that has the minimum number
of terms with the least number of literals (variables) in each term.
• By simplifying an expression to the one that uses the minimum number of
terms, we ensure that the function will be implemented with the minimum
number of gates.

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 28


3.2 Logic Gates
Karnaugh map
Procedure:
• Transfer the contents of the truth table to the Karnaugh map
• Look for adjacent cells, that is, above or to the side of a cell.
• Diagonal cells are not adjacent.
• Adjacent cells will have one or more Boolean variables in common.
• Group (circle) the two 1s in the column
• Find the variable(s) top and/or side which are the same for the group
• Write this as the Boolean result.

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 29


3.2 Logic Gates
Karnaugh map
Procedure:
• Transfer the contents of the truth table to the Karnaugh map
• Look for adjacent cells, that is, above or to the side of a cell.
• Diagonal cells are not adjacent.
• Adjacent cells will have one or more Boolean variables in common.
• Group (circle) the two 1s in the column
• Find the variable(s) top and/or side which are the same for the group
• Write this as the Boolean result.

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 30


3.2 Logic Gates
Karnaugh map
Rules of Simplification

Several groups of adjacent ones will be formed according to:


1. Only ones permitted in the groups
2. Groups can only be vertical or horizontal, not diagonal
3. The number of elements in a group must be a power of 2: ex. 1,2,4,8,16…
4. The groups can overlap.
5. The groups should be as large as possible.
6. No lonely ones.
7. Groups may wrap around at the edges of the table.

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 31


3.2 Logic Gates
Karnaugh map

groups can overlap

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 32


3.2 Logic Gates
Karnaugh map

Groups may wrap around at the edges of the table

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 33


3.2 Logic Gates
Karnaugh map

Simplified

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 34


3.2 Logic Gates
Karnaugh map
Integrating Logic Expression in Karnaugh map

𝑌 = 𝐴ҧ𝐵ത + 𝐴𝐶ҧ

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 35


3.2 Logic Gates
Karnaugh map
Integrating Logic Expression in Karnaugh map

𝑌 = 𝐵 𝐶ҧ + 𝐴𝐵 + 𝐴ҧ𝐵𝐶
ത

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 36


3.2 Logic Gates
Karnaugh map
Integrating Logic Expression in Karnaugh map

𝑌 = 𝐵 𝐶ҧ 𝐷
ഥ + ABD + 𝐴ҧ𝐵𝐷
ത + 𝐴𝐵𝐶
ത 𝐷ഥ

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 37


3.2 Logic Gates
Karnaugh map
𝑌 = 𝐴ҧ + 𝐶ҧ + 𝐵ത

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 38


3.2 Logic Gates
Karnaugh map
𝑌 = 𝐶ҧ + 𝐴ҧ + 𝐵ത

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 39


3.2 Logic Gates
Karnaugh map

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 40


3.2 Logic Gates
Karnaugh map

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 41


3.2 Logic Gates
Karnaugh map
CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 1 00 1 1 1 00

01 1 1 1 01 1 01 1 1 1
11 1 1 1 11 11 1 1 1

10 1 1 10 1 1 1 10 1

CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 00 00

01 1 1 1 1 01 01

11 1 1 1 11 11

10 1 10 10

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 42


3.3 Flip-Flop
3.3.1 SR Flip-Flop

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 43


3.3 Flip-Flop
3.3.2 Clocked D Flip-Flop

Mohamad Darwiche, PhD. MCHE 514 - Programmable Logic Controllers 44

You might also like