DIGITAL LOGIC

DESIGN (AM)
SUMMER 20
COURSE INSTRUCTOR: AQEEL TAHIR
WEEK #7 LECTURE#1:

• Objective of todays Live session is to get familiar about the following:

a) Canonical & Standard Form/ min terms & Max terms
b) SOP (Sum of Product) & POS (Product of Sum)
OUR DESIGNING APPROACH
OUR DESIGNING APPROACH (PREVIOUS APPROACH):

• Till yet our designing approach is as follows:

Logical Expression (Given) Simplified Expression (By using Boolean Algebra OR K-
map) Verify simplified Expression (By using Truth Table) Design the
logical circuit
• Now question arises that output function (Truth Table) is given and you are asked to design a
circuit that satisfies the given output.
• Consider the example on next slide.
DESIGNING OF LOGICAL CIRCUIT
PREVIOUS APPROACH (F1) = AB +
C OUTPUT FUNCTION (F1) IS GIVEN
• Logical expression is given. A B C F1
0 0 0 0
• We go for simplified version.
0 0 1 1
• Verify our results through truth table. 0 1 0 0
• Design the logical circuit. 0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
 DESIGNING OF LOGICAL CIRCUIT WHEN OUTPUT
FUNCTION IS GIVEN

• Now in our previous example, an output function is given and you are asked to design a
circuit that produces the stated output like as follows: A B C F1
• Here issue arises that to design a circuit, logical 0 0 0 0

expression is required. 0 0 1 1
0 1 0 0
• Here no logical expression is given, instead of that
0 1 1 1
an output is given. 1 0 0 0
• How to solve such case? Solution provided in next 1 0 1 1
slide. 1 1 0 1
1 1 1 1
NEW APPROACH FOR DESIGNING:

• Output function is given Go for min-term approach SOP expression

Go for Max-term approach POS expression

• After getting (SOP Or POS) expression Simplify the expression (By Boolean
algebra OR K-Map) Design the simplified expression (No need to verify)
• But, before going for either SOP Or POS approach, first understand difference between
min-term & Max-term.
DIFFERENCE BETWEEN MIN-TERM & MAX-TERM
DIFFERENCE BETWEEN MIN-TERM & MAX-TERM
MIN-TERM
• Notation is “mj”.
• “m” represent min-term and “j” represents the
decimal equivalent of binary input state.
• min-terms are those terms whose output function is
LOGIC 1.
• In min-terms when there is logic 0, variable is
complemented and for logic 1, variable remains
simple (uncomplemented).
• In min-terms, all variables are ANDed.
• In min-terms, all terms are ORED.
• The expression thus formed is stated as SOP (Sum of
Product)
MAX-TERM
• Notation is “Mj”.
• “M” represent Max-term and “j” represents the decimal
equivalent of binary input state.
• Max-terms are those terms whose output function is
LOGIC 0.
• In Max-terms when there is logic 1, variable is
complemented and for logic 0, variable remains simple
(uncomplemented).
• In Max-terms, all variables are ORED.
• In Max-terms, all terms are ANDed.
• The expression thus formed is stated as POS (Product of
Sum)
 REPRESENTATION OF MIN-TERM & MAX-TERM

MIN-TERM MAX TERM

A B C mj min-term A B C Mj Max-term
0 0 0 m0 ABC 0 0 0 M0 A+ B+ C
0 0 1 m1 ABC 0 0 1 M1 A+ B+ C
0 1 0 m2 ABC 0 1 0 M2 A+ B+ C
0 1 1 m3 ABC 0 1 1 M3 A+ B+ C
1 0 0 m4 ABC 1 0 0 M4 A+B+C
1 0 1 m5 ABC 1 0 1 M5 A+B+C
1 1 0 m6 ABC 1 1 0 M6 A+B+C
1 1 1 m7 AB C 1 1 1 M7 A+B+C
SOLUTION THROUGH MIN TERM OR MAX
TERM
• Step#1: Choose any one (01) approach, either go for min-term OR Max-term at a time.
Solution through both the approaches may differ (SOP & POS).
• Step#2: For min-term approach, consider those terms whose function output is 1 & for Max-term,
consider those whose function output is 0.
• Step#3: For min-term, write down the respective AND terms (ORED for Max-term)
• Step#4: Finally, ORED all the min-terms (AND all the Max-Terms)
• Step#5: SOP achieved through min-terms (POS through Max-Term)
• Step#6: Simplify the expression by using Boolean algebra (laws & rules) or by K-Map
REMEMBER: SOP (min-term) approach is mostly followed as its simplification is easier. Choose Max-
term approach when there is only one (1) Max term. Also, the term may be EITHER min OR Max at a time,
because the output function is either 0 Or 1 at a time.
 EXAMPLES
Q. Design the circuits satisfying the output functions indicated (in upcoming slides)
EXAMPLE #1:

A B F1
0 0 1
0 1 0
1 0 1
1 1 1
 SOLUTION (THROUGH MIN-TERM APPROACH)

A B F1 mj Min term
= ∑ (0 , 2 , 3)
0 0 1 m0 A. B
= m0 + m2 + m3
0 1 0
1 0 1 m2 A. B = A.B + A.B + A.B is required SOP.
1 1 1 m3 A.B

Simplification is shown in next slide

SIMPLIFICATION OF SOP EXPRESSION
• Remember, for simplifications, different approaches are applicable (results in different
simplified expressions) but all expressions are correct (verified through truth table).
= A.B + A.B + A.B
Approach #1: Approach #2 Approach#3
= A.B + A.B + A.B = A.B + A.B + A.B = A.B + A.B + A.B
(Taking B common) (Taking A common) = A.B + A.B + AB
= B (A + A) + AB = A.B + A( B + B) = A.B +
= B + AB = A.B + A
 VERIFYING ALL EXPRESSIONS

A B A B AB F1=B+AB A.B F2 = A.B+A A.B F3 = A.B +

0 0 1 1 0 1 1 1 0 0 1 1
0 1 1 0 0 0 0 0 0 1 0 0
1 0 0 1 0 1 0 1 1 1 0 1
1 1 0 0 1 1 0 1 0 0 1 1
WHY VERIFYING IS NOT RECOMMENDED FOR
SOP OR POS?
• Previously, while defining our approach to design the circuit either by min-term or max
term approach, we observed that verification is not required. Question arises why?
• Because all our SOP’s or POS’s correspond to the same output (means this time, we
started from our original truth table, hence no need to verify it again).
• One can observed from our previous slide that as all the SOP’s result to the same output
which actually corresponds to the given original function.
 SOLUTION (THROUGH MAX-TERM APPROACH)

A B F1 Mj Max term
= ∏ (1)
0 0 1
= M1
0 1 0 M1 A+ B
1 0 1 = A + B is required POS.
1 1 1 In the given example, POS approach is
more convenient (as contains only 1 Max-
term). However min-term approach is
RECOMMENDED at its simplification is
easier.
EXAMPLES:

F2 (A, B, C) F3 (A, B, C) F4 (X, Y, Z)

0 0 1
1 1 0
1 1 0
0 0 1
1 1 0
1 0 0
1 1 1
1 1 1
 F2 (SOLUTION):

F2 mj Through min-term approach

(A,B,C)
0 = ∑ (1, 2, 4, 5, 6, 7)
1 m1 = A.BC + ABC + AB.C + ABC +ABC + ABC (The form is SUM OF PRODUCTS)
1 m2
= (A.BC + ABC) + (ABC + ABC) + AB.C + ABC
0
Simplifying by using Boolean algebra
1 m4
1 m5 = BC(A+A) + BC (A+A) + A(B.C + BC)
1 m6 = BC + BC + A(B C)’
1 m7
= (B C) + A(B C)’
F2 (SOLUTION):

F2(A,B,C) mj Through Max-term approach

0 M0
= ∏ (0, 3)
1
1 = (A + B + C) (A + B + C) (the form is PRODUCT OF SUMS)
0 M3 Simplifying by using Boolean algebra
1 = A(A + B + C) + B(A + B + C) + C(A + B + C)
1
= A.A + AB + AC + AB + B.B + BC + AC + BC + CC
1
1 = A + AB + AC + AB + AC + BC + BC
= A( 1 + B + C + B + C) + (B C)
= A + (B C)
 F3 (SOLUTION):

F3(A,B,C) mj Through min-term approach

0
= ∑ (1, 2, 4, 6, 7)
1 m1
1 m2 = A.BC + ABC + AB.C + ABC + ABC
0 Simplifying by using Boolean algebra
1 m4
= A(BC+BC) + AC (B+B) + AB.C
0
1 m6 = A(B C) + AC+ AB.C
1 m7
 F4 (SOLUTION):

F2(X,Y,Z) mj Through min-term approach

1 m0
= ∑ (0, 3, 6, 7)
0
0 = X.Y.Z + XYZ + XYZ + XYZ
1 m3 Simplifying by using Boolean algebra
0
= X(Y.Z+YZ) + XY(Z+Z)
0
1 m6 = X(Y Z)’ + XY
1 m7