Construction of Truth Tables – Boolean Equations Simplification

Digital Logic & Design (DLD)

FOIT & CS - UCP

Engr. Aamir Hayat

University of Central Punjab
Logic Function or Equation from Truth Tables -
Boolean Identities Simplification
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation – Terminologies & representation

F (X, Y) = XY + Y’
variable
operator literals
FOIT & CS - UCP

❑ A Boolean expression is made of Boolean variables and constants

combined with logical operators: AND, OR and NOT
❑ A literal is each instance of a variable or constant.
❑ Boolean expressions are fully defined by their truth tables
❑ A Boolean expression can be represented using interconnected logic
gates
– Literals correspond to the input signals to the gates
– Constants (1 or 0) can also be input signals
– Operators of the expression are converted to logic gates

❑ Example: a’bd + bcd + ac’+ a’d’ (4 variables, 10 literals, ?? gates)

2
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation – Terminologies &

representation – Operator Procedure
❑ Given a Boolean expression, the order of operations
depends on the precedence rules given by:
FOIT & CS - UCP

1. Parenthesis Highest Priority

2. NOT
3. AND
4. OR Lowest Priority

❑ Example: Draw original logic circuit diagram ??

3
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation – Terminologies &

representation – Operator Procedure
Example 1
❑ F = X . ( Y’ + Z)
– This function has three inputs X, Y, Z and the output is given by F
FOIT & CS - UCP

– As can be seen, the gates needed to construct this circuit are: 2

input AND, 2 input OR and NOT

X
Y Y’ F

4
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation – Terminologies &

representation – Operator Procedure
Example (Continues)
A Boolean function can be represented with a truth table
FOIT & CS - UCP

F = X . ( Y’ + Z)
X Y Z Y’ Y’ + Z F = X . (Y’+Z)
0 0 0 1 1 0
0 0 1 1 1 0
0 1 0 0 0 0
0 1 1 0 1 0
1 0 0 1 1 1
1 0 1 1 1 1
1 1 0 0 0 0
1 1 1 0 1 1 5
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation – Terminologies &

representation – Operator Procedure
Example 2
❑ X = M + M.C + A.M + A.C + A.M.C
– This function has three inputs A, M, C and the output is given by X
FOIT & CS - UCP

– As can be seen, the gates needed to construct this circuit are: Three
2 input AND & one 3 input AND gate, Two 2 input OR and one 3
input OR gate

6
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Example: Find a Boolean expression for F and draw the
corresponding binary logic diagram.
❑ Since there are fewer 1's than 0's under F,
FOIT & CS - UCP

we are going with minterms and the

product of sums.
That is F(X,Y,Z) = m(2,3,5). Therefore
F(X,Y,Z) = X'YZ‘+X'YZ+XY'Z
Our immediate problem is "can this be simplified"? Lets try ...
X'YZ' + X'YZ + XY'Z = X'Y(Z'+Z) + XY'Z = X'Y + XY'Z
Doesn't look like we can go much further than this, so
F(X,Y,Z) = X'Y + XY'Z
7
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

Then the diagram of this reduced equation would be……..
F(X,Y,Z) = X'Y + XY'Z
FOIT & CS - UCP

F(X,Y,Z)=X’Y+XY’Z

8
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Example 2: Find a Boolean expression for F and draw the
corresponding digital logic diagram.
➢ Since this truth table shows only two 0's
FOIT & CS - UCP

and fourteen 1's under F, then definitely we

are going with maxterms and a product
of sums. That is
F(A,B,C,D) = M(3,12) OR
= (A+B+C‘+D‘) • (A‘+B‘+C+D)
Next question is "can this be simplified"?
Maybe we can, but right now it looks like
if we "multiply" we'll end up with more
operations than we have now. So, leave
the function as it is.
9
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

Then the diagram of this reduced equation would be……..
FOIT & CS - UCP

F(A,B,C,D)=(A+B+C’+D’).(A’+B’+C+D
10
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

Logic representations:
(a) truth table (b) boolean equation
from 1 - rows in truth table:
FOIT & CS - UCP

F = X ’Y’Z’ + X ’YZ + XY’Z’ + XYZ ’ + XYZ

F = Y ’Z’ + XY + YZ

from 0 - rows in truth table:

’ Z) (X’+ Y + Z’)
F = (X + Y + Z’ ) ( X +Y +

F = (X + Y ’ + Z)(Y + Z’ )

11
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ In designing digital circuits, the designer often begins with a truth table
describing what the circuit should do. The design task is largely to
determine what type of circuit will perform the function described in the
truth table. While some people seem to have a natural ability to look at a
FOIT & CS - UCP

truth table and immediately envision the necessary logic gate or relay
logic circuitry for the task, there are procedural techniques available for
the rest of us. Here, Boolean algebra proves its utility in a most dramatic
way.

❑ To illustrate this procedural method, we should begin with a realistic

design problem. Suppose we were given the task of designing a flame
detection circuit for a toxic waste incinerator. The intense heat of the
fire is intended to neutralize the toxicity of the waste introduced into the
incinerator. Such combustion-based techniques are commonly used to
neutralize medical waste, which may be infected with deadly viruses or
bacteria: 12
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Thus, our truth table would look like this:
FOIT & CS - UCP

❑ It does not require much insight to realize that this functionality could be
generated with a three-input AND gate: the output of the circuit will be
"high" if and only if input A AND input B AND input C are all "high:" 13
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Three other rows of the truth table have an output value of 1, so those
rows also need Boolean product expressions to represent them
FOIT & CS - UCP

14
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Finally, we join these four Boolean product expressions together by
addition, to create a single Boolean expression describing the truth
table as a whole:
FOIT & CS - UCP

15
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Now that we have a Boolean Sum-Of-Products expression for the truth
table's function, we can easily design a logic gate or relay logic circuit
based on that expression:
FOIT & CS - UCP

16
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ Unfortunately, both of these circuits are quite complex, and could benefit
from simplification. Using Boolean algebra techniques, the expression
may be significantly simplified:
FOIT & CS - UCP

17
Construction of Truth Tables – Boolean Equations Simplification

Logic Equation from Truth Table

❑ As a result of the simplification, we can now build much simpler logic
circuits performing the same function, in either gate or relay form:
FOIT & CS - UCP

18