SWITCHING THEORY

AND LOGIC
DESIGN
UNIT-I

BOOLEAN ALGEBRA
Switching functions
Canonical forms and Standard forms
Simplification of switching functions using
theorems.
 Switching Functions
• Switching functions are also called as Boolean Functions
• Boolean expressions are constructed by connecting Boolean
constants and variables with Boolean operators.
• Boolean expressions are also known as Boolean formulae.
• Boolean expressions are used to describe Boolean
functions.
• Example: The Boolean expression (A + B’) C is used to
describe the function f , then the Boolean function written
as
f(A, B, C) = (A + B’) C(or) f
•In the following Boolean function, the variables appeared either
in a complemented or in an uncomplemented form
•Occurrence of variable either in a complemented or in an
uncomplemented form is called a Literal.
•A product term is defined as either a literal or product of
literals.
• The above Boolean function consists of seven literals, they
appear in sum terms.
• A sum term is defined as either literal or sum of literals.
 Standard Forms
• Boolean function can be expressed in the standard
form.
• In the standard form, the terms that form the function
may contain one, two, or any number of literals.
• The literals and terms are arranged in one of the two
standard forms:
(1) Sum Of Products form (SOP)
(2) Product Of Sums form (POS)
 Sum Of Products (SOP)
• The sum and product are derived from the
symbolic representations of the OR and AND
functions by + and . boolean operators
•
Product term is group of literals that are
ANDed together.
example: A.B.C , X.Y
• Sum term is group of literals that are
Ored together.
example: A + B + C, X +
• Sum Of Products (SOP): It is a boolean expression containing
AND terms, called product terms. Sum(OR) of these product
terms having one or more literals called SOP form
Example: Sum
f(A,B,C) = A B C + A B’
C’
Product terms
• Each of these sum of products expression consist of two or
more product terms (AND) that are ORed together
• Each product term consists of one or more literals, appear in
either complemented or uncomplemented form
• The sum of products form is also known as disjunctive
normal form
 Product Of Sums (POS)
• A product of sums is group of sum terms ANDed
E together.
xample: Product
f(A,B,C) = (A + B) . (B’ +
C) Sum terms
• Product of sums expression consist of two or sum terms (OR)
more that are ANDed together.
• Each sum term consists of one or more literals, appear in
either complemented or an uncomplemented form.
• The product of sums form is also known as conjunctive
normal form
 Canonical Forms
• The canonical forms are the special cases of Sum Of
Product (SOP) and Product Of Sum (POS) forms
• These are also known as standard Sum Of
Product(SOP) and standard Product Of Sum
(POS) forms
 Standard SOP
• In the SOP form allForm
the individual terms do not involve all
literals.
• Example: AB + ABC’
• If each term in SOP form contains all the literals, then the SOP
form is known as Standard or canonical SOP form.
• Each individual term in standard SOP form is called minterm.
So it also called as minterm canonical form.
• Example: f(A,B,C) = A B’C + A B C + A’ B C’
Each product term consists of all literals in either complemnted or
uncomplemented form
 Standard POS form
• If each term in POS form contains all the literals,
then the POS form is known as standard or
canonical POS form.
• Each individual term in the standard POS form is
called maxterm. So it is also known as
maxterm canonical form
Example: f(A,B,C) = (A + B+ C) . (A + B’ +
C)
Each sum term consists of all literals in either complemnted or un
Converting expressions in to standard SOP or POS form
• Steps to convert SOP to Standard SOP form:
– Step1: Find the missing literal in each product term.
– Step2: AND each product term having missing literal with
term formed by ORing the literal and its complement.
– Step3: Expand the terms by applying distributive law
and reorder the literals in the product terms.
– Step4: Reduce the expression by omitting repeated
product terms, if any. Because A + A = A.
 Example
• Convert the given expression in to standard SOP form
f(A,B,C) = AC + AB + BC
• Solution:
Step1: Find the missing literal in each product term.
f(A,B,C) = AC + AB + BC
Literal B is missing Literal A is missing
Literal C is missing
• Step2: AND product term with (missing literal + its complement).
Original product terms
f(A,B,C) = AC . (B+B’) + AB . (C+C’) + BC . (A+A’)
Missing Literals and their complements
• Step3: Expand the terms and reorder literals
Expand: f(A,B,C) = ACB +ACB’ + ABC + ABC’ + BCA +
BCA’ Reorder: f(A,B,C) = ABC + AB’C + ABC + ABC’ + ABC
+ A’BC
• Step4:Omit repeated product terms
f(A,B,C) = ABC + AB’C + ABC + ABC’ +ABC +
A’BC

f(A,B,C) = ABC + A B’C + ABC’ +A’BC

----Standard SOP form (Canonical form)
• Steps to convert POS to standard POS form
–Step1: Find the missing literal in each sum term, if any.
–Step2: OR each sum term having missing literal with
term formed by ANDing the literal and its complement.
–Step3: Expand the terms by applying distributive law and
reorder the literals in the sum terms.
–Step4: Reduce the expression by omitting repeated sum
terms if any . Because A . A = A.
 EXAMPLE
• Convert the given expression in to standard POS Form
f(A,B,C) = A . (A+B+C)
• Solution:
Step1: Find the missing literal in each sum term
f(A,B,C) = A . (A+B+C)
Literals B and C are missing
• Step2: OR sum term with ( missing literal . Its complement)
f(A,B,C) = ( A + B.B’ + C.C’) ( A + B + C)
Missing literals and their complemnts
• Step3: Expand the terms and reorder literals.
since A + BC = (A + B) (A + C)
f(A,B,C) = (A + B.B’+ C) (A + B.B’ +
C’) (A + B + C)

= (A + B + C) ( A + B’ + C) (A + B + C’) (A + B’
+ C’) ( A+ B+ C)
• Step4: Omit repeated sum terms

f(A,B,C) = (A + B + C) (A + B’ + C) (A + B + C’) (A + B’ + C’) (A + B +

C)

f(A,B,C) = (A + B + C) (A + B’ + C) (A + B + C’) (A + B’ + C’)

----Standard POS form (Canonical form)
 M-Notations : Minterms and Maxterms
• Minterm is a product term having all the variables of the
function either in its normal or complimented form
• Each individual term in standard SOP form is called
Minterm
• Maxterm is a sum term having all the variables of the
function either in its normal or complimented form
• Each individual term in standard POS form is called
Maxterm
• For an n-variable logical function there are 2n
minterms and an equal number of maxterms.
 Minterms and Maxterms for Three Variables
•Each minterm is represented by mi .
•Each maxterm is represented by Mi .
• Where i is the decimal number equilent of the binary
number
 Examples
• Minterms:
f( A,B,C) = A’ B’ C’ + A’ B’C + A’ B C + A B C’
= m0 + m1 + m3 + m6 =
• Maxterms:
f( A,B,C) = (A + B + C’) (A + B’ + C’) (A’ + B’ +
C)
Where Л denotes
= M1 +product
M3 of sum
+ Mand
6 = ЛMIndicates
(1, 3 ,6)sum of product
 Simplification of Switching Functions using Theorems
• Example 1: Simplify the expression Z = A B + A B’ . (A’C’)’.
Solution: Apply the Demorgan’s theorem and multiply out all terms.
Z = A B + A B’ . (A’C’)’
= A B + A B’ . (A’ + C’’).
= A B + A B’ .(A + C)
= A B + A B’ A + A B’ C
= A B + A B’ + A B’ C
= A B + A B’ ( 1 + C)
= A B + A B’
= A ( B + B’)
= A
 • Example2: Simplify the following three variable expression
using Boolean algebra, Y=
•Step 1: From the minterms we can write expression in SOP form
Y = A’ B’ C + A’ B C +A B’ C + A B C
• Step 2: Search for common terms for factorization
Y = A’ B’ C + A’ B C + A B’ C + A B C
= A’ C ( B + B’) + A C
( B’ + B)
= A’ C + A C
= C ( A’ + A)
=C
• Example3: Simplify the following three variable expression
using algebra Y = Л M
Boolean
Solution: (3,5,7) Y =

From the minterms write expression in SOP form

Y = A’ B’ C’ + A’ B’ C + A’ B C’ + A B’ C’ + A B C’
= A’ B’ C’ + A B’ C’ + A’ B C’ + A B C’ + A’ B’ C
= B’ C’ (A’ + A) + BC’ ( A’ + A) + A’ B’ C
= B’ C’ + B C’ + A’ B’ C
= C’ ( B’ + B) + A’ B’ C
= C’ + A’ B’ C from A + A’ B
=A+B
 Conclusions
Switching functions
Canonical forms and Standard forms
 Simplification of switching functions using theorems