Industrial Electronics (EPM 151)

Lectures 9 and 10
Logic Gates and Digital Circuits
Prof. Mostafa I. Marei

1
 Logic Gates
• Logic Gates are the building blocks of digital systems
• Logic Gates (AND, OR, NOT, NAND, NOR, XOR, ….) built from transistors

• An Integrated Circuit (IC) is a miniaturized electronic circuits whose

components (transistors, resistors, capacitors) are built on the
surface of a semiconductor wafer, using the same planar fabrication
technology.
2
 Why we study Logic Gates
• It is part of the Electrical engineering program !
• It is basis for all modern control systems which is required for Electrical Power
Systems and Components
• It offers an interesting exposure of building large things from small elements.

Objective: Design digital circuits

Text book:
M. Morris Mano and Michael D. Ciletti, “Digital Design”,
Pearson, 5th Ed., 2013. Chapter 2.

3
 Binary numbers
• Digital signals consist of pulses or digits with discrete levels or values.
• Binary System manipulates discrete data represented in binary form.
• Described by a signal of two amplitude levels called 1 or 0, HIGH or LOW, TRUE
or FALSE, On or OFF.

• A Binary digit is called a bit.

• A Bit has one of two possible values (0 or 1).
• 1 Byte = 8 bits

4
 Binary Logic & Basic Logic gates
• A logic gate is a simple electronic circuit that operates on one, two, or more
inputs to produce an output.
• Truth table shows the input-output relationship for all possible inputs.

AND OR

A, B, Z are bits

5
 Binary Logic & Basic Logic gates

Inclusive

Exclusive 6
 Binary Logic & Basic Logic gates
• The output from XOR gate is 1 when the inputs are not equivalent.
• XOR is also known as “non-Equivalent” gate.
• Any binary logic operation can be achieved using either NAND or NOR gates.
Example 1:
Using NAND gates only construct NOT, AND, OR gates.

NOT:

AND:

7
 Binary Logic & Basic Logic gates
OR :

8
 Binary Logic & Basic Logic gates
Example 2:
Using NOR gates only construct NOT, AND, OR gates.

NOT:

OR:

9
 Binary Logic & Basic Logic gates
AND:

10
Digital Gates ICs

11
 Boolean Algebra
• Boolean Algebra enables us to simplify logic expressions found in truth tables.
 A.A=A
 A+A=A
 A+A=1
 A.A=0
• Inverse law:
 A=A
• Commutative Law:
 A+ B = B + A
 A.B=B.A
• Associative law:
 A + (B + C) = (A + B) + C
 A . (B . C) = (A . B) . C
• Distributive Law:
 A . (B + C) = (A . B) + (A . C)
 A + (B . C) = (A + B) . (A + C)
12
 Boolean Algebra
• Identity law:
 0.A=0
 1.A=A
 0+A=A
 1+A=1

• Absorption law:
 A + (A . B) = (A . 1) + (A . B) = A . (1 + B) = A . 1 = A
 A . (A + B) = (A + 0) . (A + B) = A + (0 . B) = A + 0 = A

• De Morgans Law:
 A +B=A. B
 A .B = A + B
The proof is by using the truth table as done in the last example.

• Generalized form of DeMorgan’s Theorem

 A + B + C = A . B.C
 A .B .C = A + B + C
13
 Boolean Algebra
The Absorption law can be proved as follow:

Notes:

14
 Boolean Algebra
Example 3: Verify the absorption law using Truth table
A + (A . B) = A

A B A.B A + (A . B)
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

Example 4: Simplify y = A + B + A + B

15
 Boolean Algebra
Example 5:
Simplify,

Simplify,

Very important !!

Simplify :

16
 Boolean Algebra
Example 6:

Find the Complement Function of:

Find the Complement Function of:

17
 Boolean Algebra
Example 7: Simplify 𝐴 = 𝑋 𝑌 𝑍 + 𝑋 𝑌 𝑍 + 𝑋 𝑌 𝑍 + 𝑋 𝑌𝑍

18
 Boolean Algebra
Example 8: Simplify 𝑦 = 𝐴 . 𝐵 + 𝐴 . 𝐵 + 𝐴 . 𝐵

19
 Boolean Algebra
Example 9: Using truth table, verify that 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 = 𝐵

Solution: Construct the truth table of the LHS of the equation:

20
 Implementing functions
Example 10: Implement the logic circuits that do the following functions:
F1 = X + Y Z F2 = 𝑋 𝑌𝑍 + 𝑋 𝑌 𝑍 + 𝑋 𝑌

Solution:

Note, F2 can be simplified as follows:

F2 = 𝑋 𝑌𝑍 + 𝑋 𝑌 𝑍 + 𝑋 𝑌 = 𝑋 𝑍 𝑌 + 𝑌 + 𝑋 𝑌 = 𝑋 𝑍 + 𝑋 𝑌

21
 Implementing functions: Canonical Forms
Minterms (Standard Product)
 Binary variables combined with AND operation
 All possible products of any n binary variables are called minterms or
standard product.
 For 2 binary variables X and Y, Minterms are: 𝑋 𝑌, 𝑋 𝑌, 𝑋 𝑌, X Y

Maxterms (Standard Sum)

 Binary variables combined with OR operation
 All possible sum of any n binary variables are called minterms or standard
sum.
 For 2 binary variables X and Y, Maxterms are: 𝑋 + 𝑌, 𝑋 + 𝑌, 𝑋 + 𝑌, X + Y

22
 Implementing functions: Canonical Forms
Minterm and Maxterms for three Binary variables:

X Y Z Minterms Maxterms
Term symbol Term Symbol
0 0 0 𝑋 𝑌𝑍 m0 𝑋+𝑌+𝑍 M0
0 0 1 𝑋 𝑌𝑍 m1 𝑋+𝑌+𝑍 M1
0 1 0 𝑋 𝑌𝑍 m2 𝑋+𝑌+𝑍 M2
0 1 1 𝑋 𝑌𝑍 m3 𝑋+𝑌+𝑍 M3
1 0 0 𝑋 𝑌𝑍 m4 𝑋+𝑌+𝑍 M4
1 0 1 𝑋 𝑌𝑍 m5 𝑋+𝑌+𝑍 M5
1 1 0 𝑋 𝑌𝑍 m6 𝑋+𝑌+𝑍 M6
1 1 1 XYZ m7 𝑋+𝑌+𝑍 M7

According to DeMorgan Theorem, each maxterm is the complement of its

corresponding minterm: 𝒎𝒋 = Mj
23
 Implementing functions: Canonical Forms
Example 11: Express F given in the following truth table using Minterm and
Maxterms.
x y z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

24
 Implementing functions: Canonical Forms
Solution: Construct the Minterm corresponding to terms where F= 1 and
Maxterms for F=0.
x y z F Minterms Maxterms
0 0 0 0 𝑋+𝑌+𝑍
0 0 1 1 𝑋 𝑌𝑍
0 1 0 0 𝑋+𝑌+𝑍
0 1 1 0 𝑋+𝑌+𝑍
1 0 0 1 𝑋 𝑌𝑍
1 0 1 0 𝑋+𝑌+𝑍
1 1 0 0 𝑋+𝑌+𝑍
1 1 1 1 XYZ

Using Minterms (Sum of Product SoP):

F = 𝑋 𝑌𝑍 + 𝑋 𝑌𝑍 + X Y Z
= m1 + m4 + m7
= (1,4,7)
25
 Implementing functions: Canonical Forms
Solution: Construct the Minterm corresponding to terms where F= 1 and
Maxterms for F=0.
x y z F Minterms Maxterms
0 0 0 0 𝑋+𝑌+𝑍
0 0 1 1 𝑋 𝑌𝑍
0 1 0 0 𝑋+𝑌+𝑍
0 1 1 0 𝑋+𝑌+𝑍
1 0 0 1 𝑋 𝑌𝑍
1 0 1 0 𝑋+𝑌+𝑍
1 1 0 0 𝑋+𝑌+𝑍
1 1 1 1 XYZ

Using Maxterms (Product of Sum PoS):

F= 𝑋+𝑌+𝑍 𝑋+𝑌+𝑍 𝑋+𝑌+𝑍 𝑋+𝑌+𝑍 𝑋+𝑌+𝑍
= M0 M2 M3 M5 M6
= π(0,2,3,5,6)
26
Functions for Two Binary Variables

27
 Implementing functions: Canonical Forms
Example 12: Design a logic circuit that satisfy the
operation of the given truth table.

Solution:
Step 1:

Construct the product terms

Step 2:

Using SoP form, Z is equal to the sum of non zero

product terms.

28
 Implementing functions: Canonical Forms
Step 3: Simplify the obtained expression,

Step 4: Draw the circuit,

29
 Implementing functions: Canonical Forms
Example 13: Design a logic circuit that satisfy the
operation of the given truth table.

Solution:
Step 1: Construct the product terms

Step 2: Using SoP form, Z is equal to the sum of

non zero product terms. 30

 Implementing functions: Canonical Forms
Step 3: Simplify the obtained expression,

Step 4: Draw the circuit,

Note: we used only one gate for implementing this function. Without
simplifications (Step 3), we need many gates to implement the same function
which increase the cost and power consumption.
31