E1121 Digital LOGIC (a)

Fall 2020

Lecture 6
 Canonical Forms
01
Agenda
SoP and PoS Form
02

Function Simplification
03
Canonical Forms
Boolean Functions

• Boolean Expression x y z F
Example: F = x + y’ z 0 0 0 0
• Truth Table 0 0 1 1
All possible combinations of input variables
0 1 0 0
• Logic Circuit
0 1 1 0
1 0 0 1
x F
y 1 0 1 1
z 1 1 0 1
1 1 1 1
 Boolean Functions (cont.)

• Boolean Expression
x y z F
– F = ??
0 0 0 0
• Logic Circuit
– ???
0 0 1 1
0 1 0 0
 Boolean expression can be represented by either 0 1 1 0
 Sum of minterms /product 1 0 0 1

 e.g. ABC+AB’C 1 0 1 1
1 1 0 1
 Product of Maxterms /Sum
1 1 1 1
 e.g. (A+B+C)(A+B’+C)
 Minterm

• Product (AND function) A B C Minterm

• Contains all variables
0 0 0 0 m0 ABC
• Evaluates to ‘1’ for a specific combination
1 0 0 1 m1 ABC
• Denoted by mj
– where j is the decimal equivalent of the minterm’s
2 0 1 0 m2 ABC
corresponding binary combination (bj). 3 0 1 1 m3 ABC
4 1 0 0 m4 ABC
– A variable in mj is complemented if its value in bj
5 1 0 1 m5 A B C
is 0, otherwise is uncomplemented.
6 1 1 0 m6 A B C
– Example
7 1 1 1 m7 A B C
✓ If m3 Then, bj = 011 and its corresponding minterm
No. of minterm = 2𝑛
is denoted by m3 = A’BC whrer n = no. of variables
 Maxterm
• Sum (OR function) A B C Maxterm
• Contains all variables
0 0 0 0 M0 A + B + C
• Evaluates to ‘0’ for a specific combination
1 0 0 1 M1 A + B + C
• Denoted by Mj
2 0 1 0 M2 A + B + C
– where j is the decimal equivalent of the
maxterm’s corresponding binary combination
3 0 1 1 M3 A + B + C

(bj). 4 1 0 0 M4 A + B + C
5 1 0 1 M5 A + B + C
– A variable in Mj is complemented if its value in
bj is 1, otherwise is uncomplemented.
6 1 1 0 M6 A + B + C
7 1 1 1 M7 A + B + C
– Example
✓ If M3 Then, bj = 011 and its corresponding
No. of maxterm = 2𝑛
maxterm is denoted by M3= A+B’+C’ whrer n = no. of variables
 Truth Table Of Boolean Function

m A B C F
F = ABC + ABC + ABC + ABC
m0 0 0 0 0
m1 0 0 1 1
m2 0 1 0 0
m3 0 1 1 0 • Canonical Sum-Of-minterm:
m4 1 0 0 1
➢ The minterms included are those mj such that F( ) = 1 in row j of
m5 1 0 1 1
the truth table for F( ).
m6 1 1 0 0
m7 1 1 1 1

Note: We write the variable name itself when its corresponding entry in the table is 1 - otherwise, we write the
complement of the variable in case of minterm.
 Truth Table Of Boolean Function

M A B C F
M0 0 0 0 0 F = ( A + B + C ) ( A + B + C )( A + B + C ) ( A + B + C )
M1 0 0 1 1
M2 0 1 0 0
M3 0 1 1 0 • Canonical Product-Of-maxterm:
M4 1 0 0 1
➢ The maxterms included are those Mj such that F( ) = 0 in row j of
M5 1 0 1 1
M6 1 1 0 0 the truth table for F( ).

M7 1 1 1 1

Note: We write the variable name itself when its corresponding entry in the table is 0 - otherwise, we write the
complement of the variable in case of maxterm.
 Canonical Forms

• Two canonical forms:

• Sum-of-minterms
• Product-of-maxterms
• Conversion between canonical forms is achieved by:
• Exchanging Σ and Π
• Listing all the missing indices
• Example:
f1(a,b,c) = a’b’c + a’bc’ + ab’c’ + abc’
= m1 + m2 + m4 + m6
= ∑(1,2,4,6) indicates that the minterms to be included are m1, m2, m4, and m6

= ∏(0,3,5,7) indicates that the maxterms to be included are M0, M3, M5, and M7

= (a+b+c)•(a+b’+c’)•(a’+b+c’)•(a’+b’+c’)
 Truth Table Of Boolean Function
 Sum of Minterms
A B C F F
F = ABC + ABC + ABC + ABC
0 0 0 0 0 1
F = m1 + m4 + m5 + m7
1 0 0 1 1 0
F =  (1,4,5,7) 2 0 1 0 0 1
F =  (0,2,3,6) 3 0 1 1 0 1
4 1 0 0 1 0
 Product of Maxterms
5 1 0 1 1 0
F = ( A + B + C )( A + B + C )( A + B + C )( A + B + C )
6 1 1 0 0 1
F = M0 M2 M3 M6 7 1 1 1 1 0
F =  (0,2,3,6)
F =  (1,4,5,7)
SoP and PoS Form
 SOP and POS Forms
• Two forms
• Sum-of-products (SOP)
• Product-of-sums (POS)
• SOP , POS forms are “like” canonical forms, except that not all variables
need appear in the individual product/sum
• SOP is an OR expression with product terms that may have less literals than
minterms
• Example: F = xy + x′yz + xy′z
• POS is an AND expression with sum terms that may have less literals than
maxterms
• Example: F = (x+y ) (x′+y+z) (x+y′+z )
 Complementing a Function Algebraically
• Expand non-canonical terms • Expand non-canonical terms
➢ by inserting equivalent of 1 in each ➢ by adding 0 in terms of missing
missing variable x: variables
(x + x’) = 1 (e.g., xx’ = 0) and using the
➢ Remove duplicate minterms distributive law

• Convert AB+AC into sum of ➢ Remove duplicate maxterms

minterm • Convert (A+B)(A+C) in product

of maxterm
• Sol. AB + AC
Sol. (A+B).(A+C)
AB(C+C’) + AC(B+B’)
(A+B+C.C’).(A+C+B.B’)
ABC+ABC’+ABC+AB’C
(A+B+C).(A+B+C’).(A+B+C)(A+B’+C)
ABC+ABC’+AB’C
(A+B+C).(A+B+C’)(A+B’+C)
Function Simplification
 Quine-McCluskey tabular Method

❑ When a function of more than six variables has to be simplified, mapping techniques
become increasingly difficult to employ and alternative methods have to be
considered.
❑ A commonly used alternative is the Quine-McCluskey tabular method.
▪ This technique is tedious, time consuming, and subject to error when performed by hand
▪ However, these difficulties can be overcome by writing a program which allows the
simplification process to be run on a computer.
▪ The method is based on the complementation theorem which can be applied to the
simplification process systematically.
This theorem is illustrated by the simple case
f = ABC + ABC = AB(C + C’)= AB
 Example 1
Simplify F (w,x,y,z)=∑(1,4,6,7,8,9,10,11,15) using tabular
(a) (b)
(c)
0001 1 √ 1,9 -001
8,9,10,11 10--
0100 4 √ 4,6 01-0
8,9,10,11 10--
1000 8 √ 8,9 100- √

0110 6 √ 8,10 10-0 √

1001 9 √ 6,7 011-

1010 10 √ 9,11 10-1 √

0111 7 √ 10,11 101- √

1011 11 √ 7,15 -111

1111 15 √ 11,15 1-11

c) repeat comparing
a) group according to b) any two minterms that differ from minterms only if
number of one’s each other by one variable can be they have the
combined dashes in same
position
18

Example 1
Simplify F (w,x,y,z)=∑(1,4,6,7,8,9,10,11,15) using tabular

mi 1 4 6 7 8 9 10 11 15

x’y’z
1,9
√ X X

4,6 w’xz’ √ X X

6,7 w’xy X X

7,15 xyz
√ X X

11,15 wyz X X

8,9,10,11 wx’ X X X X
√
√ √ √ √ √ √ √
1) The terms are inspected for columns with single X
2) Search each column whose X is covered by terms from previous step
3) The columns that not covered by step 1 or 2 are searched for common terms. if
there is no common write each one separately
F= x’y’z + w’xz’ + wx’ + xyz
Thank you