Boolean Equation Simplification - Examples

Logic Design & Switching Theory

Faculty of Engineering - UCP

Prof. Mohammad Salman Aslam

Faculty of Engineering
University of Central Punjab

Lecture No: 6c
Logic Functions & Boolean Identities
Simplification Examples
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Identities of Boolean Algebra

Faculty of Engineering - UCP

2
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

F = X’YZ + X’YZ’ + XZ
= X’Y(Z+Z’) + XZ
Faculty of Engineering - UCP

= X’Y.1 + XZ
= X’Y + XZ

3
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Simplify (X•Y' + Y•Z)•(Y•Z'+ X•Z)

Faculty of Engineering - UCP

= X•Y'•Y•Z' + X•Y'•X•Z + Y•Z•Y•Z' + Y•Z•X•Z (Z’•Z = 0)

= X•Y'•Z + X•Y•Z
= X•Z•(Y'+Y)
= X•Z•1 (Y'+Y = 1)
= X•Z (Answer) X•Z•1 = X•Z

4
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Example (Consensus Theorem)

Faculty of Engineering - UCP

XY + X’Z + YZ = XY + X’Z
Simplify XY+X’Z+YZ • Y and Z are associated
= XY+X’Z+YZ.1 with X and X’ in the
= XY+X’Z+YZ(X+X’) first two terms and
appear together in the third.
= XY+X’Z+XYZ+X’YZ • YZ is redundant and can be
= XY+XYZ+X’Z+X’YZ eliminated.
= XY(1+Z)+X’Z(1+Y) Adding an extra Inclusion of term to prove
= XY.1 + X’Z.1 step to acquire L.H.S=R.H.S
the desired
= XY + X’Z (Answer) output

5
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Reduce F1=(A + B + AB) (AB + AC + BC)

Using DeMorgan’s Theorem,
Faculty of Engineering - UCP

F1 = (A’.B.(A’+B’)).(A’+B’).(A+C’).(B’+C’)
= (A’.B.A’ + A’.B.B’).(A’+B’)(A+C’) .(B’+C’)
= (A’B + 0).(A’+B’)(A+C’) .(B’+C’)
= (A’BA’ + A’BB’) (A+C’) .(B’+C’)
= (A’B) (A+C’) .(B’+C’)
= (A’BA+A’BC’)(B’+C’)
= (0+A’BC’)(B’+C’)
= (A’BC’B’ + A’BC’C’)
= (0 + A’BC’) = A’BC’ (Answer) 6
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Simplify G = ((A+B+C).(AB+CD)+(ACD))
Faculty of Engineering - UCP

= ((A+B+C)+(AB.(C+D))) . ACD
= (A+B+C).ACD + (AB.(C+D)).ACD
= (AACD+ABCD+ACCD)+(AABCCD+AABCDD)
= (ACD+ABCD) + (ABCD+ABCD)
= (ACD +ACD(B+B) + ABCD)
= (ACD + ACD + ABCD)
= (ACD + ABCD) Rule: A = A
= (ACD(1+B)) B+B=1
= ACD (Answer) 1+B=17
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Simplify ( (A ⊕ B)•(A•C) )•( (A•B)' + (A ⊕ B) )

Faculty of Engineering - UCP

= ( (A•B'+A'•B)•(A•C) )•( (A'+B')+(A•B'+A'•B) )

= ( A•B'•A•C + A'•B•A•C ) • ( A'+B'+A•B'+A'•B )
= ( A•B'•C ) • ( A'+B' + A•B'+A'•B )
= ( A•B'•C ) • (A' + A'•B + B' + A•B' )
= A•B'•C•A' + A•B'•C•A'•B + A•B'•C•B' + A•B'•C•A•B'
= A•B'•C•B' + A•B'•C•A•B' = A•B'•C + A•B'•C
= A•B'•C (Answer)
Rule: A’•A = 0
A•A=A
B’•B’ = B’
8
 Logic Functions & Boolean Minimization
Examples
Boolean Equation Simplification - Examples

Simplify ( ( (X•Y')' + Z•X')' • (X•Y'•Z') )'

Faculty of Engineering - UCP

= (X•Y') + (Z•X') • (X•Y'•Z')

= (X•Y') + (Z•X') + (X•Y'•Z')
= (X•Y') + (Z•X') + (X•Y'•Z')
= (X•Y') + (Z•X') + (X'+Y+Z)
= (X'+Y) + (Z•X') + (X'+Y+Z)
= X'Z•X' + YZ•X' + (X'+Y+Z)
= X'Z + X'YZ + (X'+Y+Z)
= X'Z (1+Y) + (X'+Y+Z) = X'X'Z+X'YZ+ X'ZZ
= X'Z+X'YZ+X'Z = X'Z (1+Y) = X'Z (Answer)
9
 Complement of a Function
Boolean Equation Simplification - Examples

 The complement of a function F, F Truth table

Faculty of Engineering - UCP

is obtained in two ways:

A B F F’
1. Truth Table: Change 1s to 0s
0 0 0 1
and 0s to 1s
0 1 1 0
2. Boolean Expression: Apply
DeMorgan’s Theorem 1 0 1 0
(Be Careful, before begin, 1 1 0 1
surround all AND terms
with parentheses (easy to F = A’B + AB’
make a mistake!)). F’ = (A+B’).(A’+B)
= AB + A’B’
Short cut: Take the dual and
complement the literals.

10