EE 202 : DIGITAL ELECTRONICS
CHAPTER 2 : BOOLEAN
OPERATIONS by : Siti Sabariah Salihin
Electrical Engineering Department
[email protected]
Upon completion of this Topic 2
student should be able to:
2.1
2.1.1 Draw the symbols, operations and
functions of logic gates.
2.1.2 Explain the Function of Logic gates using Truth
Table.
2.1.3 Construct AND, OR and NOT gates using only
NAND gates.
2.2
2.2.1 Construct the basic concepts of Boolean Algebra
and use them in logic circuits analysis and design.
2.2.2 State the Boolean Laws.
2.2.3 Develop logic expressions from the truth table from
the form of SOP and POS
2.2.4 Simplify combinatinal Logic circuits using Boolean
Laws and Karnaugh Map
TRUTH TABLES
�A truth table is a table that describes
the behavior of a logic gate
�The number of input combinations will
equal 2N for an N-input truth table
EE 202 : DIGITAL ELECTRONICS 3
LOGIC GATES
• Circuits which perform logic
functions are called gates
• The basic gates are:
I. NOT/INVERTER gate
II. AND gate
III. OR gate
IV. NAND gate
V. NOR gate
VI. XOR gate
VII. XNOR gate
EE 202 : DIGITAL ELECTRONICS
I. NOT / INVERTER
Symbol
Gate
Timing Diagram
Truth Table
Symbol
II. AND Gate
Timing Diagram
Truth Table
Symbol
III. OR gate
Timing Diagram
Truth Table
Symbol
IV. NAND Gate
Truth Table
Timing Diagram
Symbol V. NOR Gate
Truth Table
Timing Diagram
Symbol VI. XOR Gate
Truth Table
Timing Diagram
Symbol VII. XNOR Gate
Truth Table
Timing Diagram
BOOLEAN ALGEBRA
• The Boolean algebra is an algebra dealing
with binary variables and logic operation
• The variables are designated by:
I. Letters of the alphabet
II. Three basic logic operations AND,
OR and NOT
BOOLEAN ALGEBRA
• A Boolean function can be represented by using
truth table. A truth table for a function is a list of
all combinations of 1’s and 0’s that can be
assigned to the binary variable and a list that
shows the value of the function for each binary
combination
• A Boolean expression also can be transformed
into a circuit diagram composed of logic gates
that implements the function
• Examples
F = A + BC
Truth Table
Logic circuit
Boolean Algebra Exercise
Exercise:
• Construct a Truth Table
for the logical functions at
points C, D and Q in the
following circuit and
identify a single logic gate
that can be used to
replace the whole circuit.
Solution
INPUTS OUTPUT AT
A B C D Q
Answer:
INPUTS OUTPUT AT
A B C D Q
0 0 1 0 0
0 1 1 1 1
1 0 1 1 1
1 1 0 0 1
Exercise
• Find the Boolean
algebra expression
for the following
system.
Solution:
BASIC IDENTITIES AND BOOLEAN
LAWS
BOOLEAN LAWS
COMMUTATIVE LAWS
ASSOCIATIVE LAWS
BOOLEAN LAWS
DISTRIBUTIVE LAWS
DEMORGAN’S THEOREMS
• All these Boolean basic identities and Boolean Laws
can be useful in simplifying a logic expression, in
reducing the number of terms in the expression
• The reduced expression will produce a circuit that is
less complex than the one that original expression
would have produced.
• Examples
Simplify this function
F=ABC+ABC+AC
Solution
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
Exercise:
Using the Boolean laws, simplify the following expression:
Q= (A + B)(A + C)
Solution:
Q = (A + B)(A + C)
Q = AA + AC + AB + BC ( Distributive law )
Q = A + AC + AB + BC ( Identity AND law (A.A = A) )
Q = A(1 + C) + AB + BC ( Distributive law
Q = A.1 + AB + BC ( Identity OR law (1 + C = 1)
Q = A(1 + B) + BC ( Distributive law )
Q = A.1 + BC ( Identity OR law (1 + B = 1) )
Q = A + BC ( Identity AND law (A.1 = A) )
Then the expression: Q= (A + B)(A + C)
can be simplified to Q= A + BC
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
2.2.3 Developing Logic Expression from
the Truth Table in the form of
a. Sum Of Product , SOP
b. Product Of Sum , POS
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
• Sum Of Product expression ( a.k.a SOP) is one or more
product terms (AND gate
gate)) connected by OR gate
operator. The examples for this form are:
• 1. AB + AB + AB ( 3 product terms)
• 2. ABC + ABC + ABC ( 3 product terms)
• 3. AB + CD + EF + GK + HL ( 5 product terms)
• Each of these sum of products expressions consist of
two or more AND terms which are ORed togather.
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
• Example:
Write a Sum of Product, SOP Boolean Expression
and draw their Logic Diagram for the following
given Truth Table.
A B C Y
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
• Solution:
A B C Y
0 0 0 1 ABC
0 0 1 0
0 1 0 0
0 1 1 1 ABC
1 0 0 0
1 0 1 1 ABC
1 1 0 0
1 1 1 0
The Final SOP for Truth Table is Y = A B C +A B C + A B C
and Logic Diagram is shown in following figure:
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
• Y=ABC+ABC+ABC
• Logic Diagram is shown in following figure:
A
B
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
• Exercise 1a: Write a Sum of Product, SOP
Boolean Expression and draw their Logic Diagram
for the following given truth table.
A B C Y
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
a. SUM OF PRODUCT , SOP
Exercise 2a: Develop the Truth Table for
the SOP expression Y = ABC + ABC and draw
The Logic Circuit.
Solution:
Discuss With your lecturer
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
Exercise 2a: Develop the Truth Table for
the SOP expression Y = ABC + ABC and draw
The Logic Circuit.
Solution:
A B C Y
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1 ABC
1 0 0 0
1 0 1 0
1 1 0 1 ABC
1 1 1 0
Try draw the Logic Circuit for the expression.
Y = ABC + ABC
B
Y
C
b. PRODUCT OF SUM , POS
• Product of sums expression (aka POS) is one or
more sum (OR) terms connected by AND operator.
• The examples for POS form are:
1. ( A + B + ) . ( A + B + C ) ( 2 Sum Terms )
2. ( A + B) . ( C + D ) F ( 3 Sum Terms )
3. (A + B) . (B + D) . (A+B+C) . (A+D+E) ( 4 Sum terms)
An POS expression is equal to 0 only if at least one of the sum
terms is equal to 0. Convert each binary value to the
corresponding sum term by replacing each 1 wuth the
corresponding variable complement and each o with the
corresponding variable. Example 1001 = A + B + C + D
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
b. PRODUCT OF SUM , POS
• Example: Write a Product Of Sum, POS Boolean
Expression and draw the logic diagram for the
given truth table.
A B C Y
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0 (A+B+C)
1 0 1 1
1 1 0 1
1 1 1 0
(A+B+C)
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
b. PRODUCT OF SUM , POS
• Solution:
Y=(A+B+C) . (A+B+C)
The Logic Circuit : Discuss with your lecturer
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
b. PRODUCT OF SUM , POS
• Example 1b: Develop the Truth Table for
( A + B ) . ( A + B ) . ( A + B ) and Draw Logic
circuit.
Solution:
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
The Logic Circuit: Discuss With Your Lecturer
CHAPTER 2 : EE202 DIGITAL ELECTRONICS
continue chapter 2: Part C.
