College of Engineering

ENGG627: Logic Circuit and Switching Theory

Chapter 4 – Part 1
Applications of Boolean Algebra:
Minterms and Maxterms Expansions

Slide 1 of 11
Lecture Outline

• Creating Boolean Equations

• Combinational Logic & Truth Tables
• Minterm and Maxterm Expansions
• Truth Table Construction
• Incompletely Specified Functions

Slide 2 of 11
Minterm and Maxterm Expansions
Minterms

• Consider the circuit

f = A+BC

𝑓  = 𝐴´ 𝐵𝐶+ 𝐴 𝐵´ 𝐶+
´ 𝐴 𝐵´ 𝐶+ 𝐴 𝐵 𝐶+
´ 𝐴𝐵𝐶 A SOP expression!!
 ¿ 𝑚 +𝑚 +𝑚 +𝑚 + 𝑚 A B C BC f
3 4 5 6 7
𝑚 ´ 𝐵´ 𝐶´
  0= 𝐴 0 0 0 0 0
 
¿ ∑ 𝑚(3,4,5,6,7) 𝑚
𝑚
´ 𝐵´ 𝐶
  1= 𝐴
´ 𝐵𝐶
  2= 𝐴 ´
0 0 1
0 1 0
0
0
0
0
𝑚 ´ 𝐵𝐶
  3= 𝐴 0 1 1 1 1
For a function of n variables, a 𝑚
  4= 𝐴 𝐵´ 𝐶´ 1 0 0 0 1
product term in which each of 𝑚
  5= 𝐴 𝐵´𝐶 1 0 1 0 1
the n variables appears once is 𝑚
  6= 𝐴𝐵 𝐶 ´ 1 1 0 0 1
called a minterm. 𝑚
  7= 𝐴𝐵𝐶 1 1 1 1 1

Slide 3 of 11
Incompletely specified fuctions

• Write the given function in SOP and Minterms form

• F(w,x,y,z)=w’yz+wz(y+xz)
• =w’yz+wzy+wxz
• w’(x+x’)yz+w(x+x’)yz+wx(y+y’)z
• w’xyz+w’x’yz+wxyz+wx’yz+wxyz+
wxy’z
• M7+m3+m15+
Slide 4 of 11
Minterm and Maxterm Expansions
Maxterms
• Build
  an expression by observing when is false (i.e.
´ =𝑚 + 𝑚 + 𝑚
when is true)
 𝑓
0 1 2

  𝑓 = 𝑚 0 +𝑚
´ 1 +𝑚 2
  ´ 0 𝑚
¿𝑚 ´ 1 𝑚
´2
A B C
¿ 𝑀 0 𝑀 1 𝑀 2
  𝑚 ´ 𝐵´ 𝐶´
  0= 𝐴 0 0 0 0
1
1
0 0 1 1
  𝑚 ´ 𝐵´ 𝐶
  1= 𝐴 0 1

¿ ∏ 𝑀 (0,1,2) 𝑚
𝑚
´ 𝐵𝐶
  2= 𝐴
´ 𝐵𝐶
  3= 𝐴
´ 0
0
1
1
1
0
0
1
0
0
1
1
1
0
0
0
𝑚
  4= 𝐴 𝐵´ 𝐶´ 1 0 1
1 0
 Maxterms
  are the complement 0
𝑚
  5= 𝐴 𝐵´𝐶 1 1 0 1 0
of the minterms for . 0
𝑚
  = 𝐴𝐵 𝐶 ´ 1 1 1 1 0
6
0
𝑚
  7= 𝐴𝐵𝐶 1 0

Slide 5 of 11
Minterm and Maxterm Expansions
Maxterms
• Recalling that f  m0  m1  m2  M 0  M1  M 2

f  m0  m1  m2

 ABC  ABC  ABC

  A  B  C  A  B  C   A  B  C 
A B C
1
𝑚 ´ 𝐵´ 𝐶´
  0= 𝐴 0 0 0 0 1
1
0 0 1
 M 0  M1  M 2 𝑚 ´ 𝐵´ 𝐶
  1= 𝐴 0 1
1
´ 𝐵𝐶 ´ 0 1 0
𝑚
  2= 𝐴 0 1
0
0 1 1
A POS expression!! 𝑚 ´ 𝐵𝐶
  3= 𝐴 1 0
1 0 0
𝑚
  4= 𝐴 𝐵´ 𝐶´ 1 0 1
1 0
´𝐶 0
𝑚
  5= 𝐴 𝐵 1 1 0 1 0
´ 0
𝑚
  = 𝐴𝐵 𝐶
6
1 1 1 1 0
𝑚
  7= 𝐴𝐵𝐶 1 0

Slide 6 of 11
Minterm and Maxterm Expansions
Maxterms vs Minterms
Minterm Expression: f  A BC  AB C  AB C  ABC  ABC
¿ 𝑚 3 +𝑚 4 +𝑚 5 +𝑚 6+ 𝑚7
 

Maxterm Expression: f   A B C  A B C  A B C

 M 0  M1  M 2
A B C Minterms
Minterms Maxterms
0 0 0 1
0 1
0 0 1 1
0 1
0 1 0 1
0 1
0 1 1 0
1 0
1 0 0 0
1 0
1 0 1 0
1 1 0 1 0
0
1 1 1 1 0
0
1 0

Slide 7 of 11
Minterm and Maxterm Expansions
An Example
a b c d f
1
•  Given f  a bbadd  a c d 0 0 0 0 0 0 1
0 0 0 1 1 0
1 1 0
1
 Minterm expansion for : 2 0 0 1 0 0
1
0 0 1 1 1 0
f   m(1,3, 4,5, 6, 7,10,14)
3 1 0
0
4 0 1 0 0 1
1 0
5 0 1 0 1 1
1
 Minterm expansion for : 6 0 1 1 0 1 0
1
0
f   m(0, 2,8,9,11,12,13,15) 7 0 1 1 1 1 0
1
1 0 0 0 0 1
8 0
1 0 0 1 1
 Maxterm expansion for : 9 0 1
0
10 1 0 1 0 1
f   M (0, 2,8,9,11,12,13,15) 1 1
1 0 1 1 0 1
11
0
1
12 1 1 0 0 0
 Maxterm expansion for : 13 1 1 0 1 0
1
0
1
f   M (1,3, 4,5, 6, 7,10,14)
14 1 1 1 0 1
1 1 1 1 0 1
1
15 1
0
1
Slide 8 of 11
Minterm and Maxterm Expansions
An Example
• For
  a given system its output () is true if and only if exactly two
of its three inputs () are true
 Derive a minterm expression for A

System
B f
f   m(3,5, 6) C

A B C
 Derive a SOP expression for 1
𝑚 ´ 𝐵´ 𝐶´
  0= 𝐴 0 0 0 0 1
f  A BC  ABC  ABC ´ 𝐵´ 𝐶 0 0 1
1
𝑚
  1= 𝐴 0 1
1
´ 𝐵𝐶 ´ 0 1 0
𝑚
  2= 𝐴 0 1
0
0 1 1
 Derive

M  0,1, 2, 4, 7  for
f  a maxtermexpression 𝑚
𝑚
´ 𝐵𝐶
  3= 𝐴
  4= 𝐴 𝐵´ 𝐶´
1 0 0
1
0
0
1
0
1
1 0 1
´𝐶 0
𝑚
  5= 𝐴 𝐵 1 1 0 1 0
´ 1
f   A B  C  A B C  A B  C  A  B  C  A  B  C 
𝑚
  = 𝐴𝐵 𝐶
6
1 1 1 1 0
 Derive a POS expression for
𝑚
  7= 𝐴𝐵𝐶 0 1

Slide 9 of 11
Incompletely Specified Functions

• The four inputs to a circuit (A,B,C,D) 0

represent an 8-4-2-1 BCD digit. Design 1
2
the circuit so that the output (Z) is 1 iff
3
the decimal number represented by the 4
inputs is exactly divisible by three (i.e. a 5
remainder of “0”). 6
 Assume that only valid BCD digits 7
8
occur as inputs. 9

These inputs will not occur.

Do I care what the associated outputs are?

Z   m(0,3, 6,9)  d (10,11,12,13,14,15)

Slide 10 of 10
Incompletely Specified Functions

•  
A B C F
0 0 0 1
1
F  ABC  ABC  ABC  ABC  BC 0 0 1 0
1
X
0
0
0 1 0 0
1
F  ABC  ABC  ABC  ABC  AB  BC 0 1 1 1
0
1 0 0 0
0
1 0 1 0
F  ABC  ABC  ABC  ABC  ABC  BC  AB 1
1 1 0 1
X
0
1 1 1 1
F  ABC  ABC  ABC  ABC  ABC
 AB  BC  AB
We can select the “don’t cares” to make our expression simpler!!
Slide 11 of ???