Chapter3: Gate-Level Minimization

Lecture2- Five-Variables Function Simplification using Map

Method, Product-of-Sum (POS)Simplification using Map Method
Engr. Arshad Nazir, Asst Prof
Dept of Electrical Engineering
Fall 2023 SEECS 1
Fall 2023 2
 Objectives
• Functions Simplification in Sum-of-Products (SOP) form
using Five and Six-Variables Map
• Product of Sums Minimization
• Don’t Care Conditions

Fall 2023 3
5-Variable Map Patterns

Fall 2023 4
5-Variable Map Patterns

Fall 2023 5
 5-Variable Map Patterns
• The number of adjacent squares that may be combined always represent a
number that is a power of 2 such as 1, 2, 4, 8, 16, and 32.
➢ One square represents one minterm with five literals.
➢ Two adjacent squares represents a term of four literals.
➢ Four adjacent squares represents a term of three literals.
➢ Eight adjacent squares represents a term of two literals.
➢ Sixteen adjacent squares represents a term of one literal.
➢ Thirty-two adjacent squares represents the entire map and produces a
function that is always equal to 1.
Note that the squares on map can be combined horizontally or
vertically but not diagonally since these differ by more than one
variable.

Fall 2023 6
 Minimization Example of 5-Variable Map
Example 3-7: Simplify the Boolean function
F(V,W,X,Y,Z) = ∑(0,2,4,6,9,13,21,23,25,29,31)

vxz
V′w′z′

WY′Z

F = v′w′z′ + wy′z + vxz

Fall 2023 7
Minimization Example of 5-Variable Map

Fall 2023 8
 6-Variable Map Patterns

• A six-variable map holds sixty four minterms for six variables.

➢ We use four four variable maps with two of the variables
distinguishing between the four.
➢ Each square in the first map is adjacent to the corresponding
square in the second map (i.e. 4 and 20 are adjacent) and in
the fourth map(i.e. 4 and 36 are adjacent). It is just like placing
one map on the top of the other.
Fall 2023 9
6-Variable Map Patterns

Fall 2023 10
 6-Variable Map Patterns
• The number of adjacent squares that may be combined always
represent a number that is a power of 2 such as 1, 2, 4, 8, 16, 32, and
64.
➢ One square represents one minterm with six literals.
➢ Two adjacent squares represent a term of five literals.
➢ Four adjacent squares represent a term of four literals.
➢ Eight adjacent squares represent a term of three literals.
➢ Sixteen adjacent squares represent a term of two literals.
➢ Thirty-two adjacent squares represents a term of one literal.
➢ Sixty-four adjacent squares represent the entire map and
produce a function that is always equal to 1.

Fall 2023 11
Minimization Example of 6-Variable Map
Example: Simplify the Boolean function
F(A,B,C,D,E,F)=
∑(9,11,13,15,16,18,19,25,27,29,31,41,43,45,47,50,51,57,59,61,63 )

Fall 2023 12
 Product of Sums Minimization
• By definition, all the squares in a map that are not marked with a
1 represent the complement of the function.
➢ If we mark the empty squares with 0s and then combine the
zeros into valid adjacent squares, we obtain a simplified
expression of the complement of the function i.e., F′
➢ The complement of F′ [as (F′)′ = F] by DeMorgan’s theorem
(by taking the dual and complementing each literal, section
2-4), gives us the product of sums form

Fall 2023 13
 POS Minimization Example
xz yz

0
W′x 0 0 0 0 xy
0 0 0
0

12)

F′ = w′x + yz + xz + xy
F = (F′)′=(w′x + yz + xz + xy)′ = (w + x′)(y′ + z′)(x′ + z′)(x′ + y′)

Fall 2023 14
 Example 3-8
• F = S(0,1,2,5,8,9,10)
Simplify the function in
➢sum of products (SOP)
➢Product of sums (POS)
• Solution:
➢ The squares marked with 1’s represents
minterms and are combined to form
simplified function in sum of products
(SOP). F=B′D′+B′C′+A′C′D
➢ If the squares marked with 0’s are are
combined we obtain the simplified
complemented function F′=AB+CD+BD′
➢ Applying DeMorgan’s theorem we
obtain the simplified function in product
of sum form (POS) F=(A′+B′)(C′+D′)(B′+D)Fall 2023 15
SOP and POS Gate Implementation
Two-level logic diagrams

Fall 2023 16
Listing Truth Table using SOP and POS

Fall 2023 17
 Working With Maxterms
• At times, we may be required to work with maxterms.
➢ The previous process actually worked with minterms. Remember that the
numbers used for minterms are the opposites of the numbers used for
maxterms:
o F(w, x, y, z) = ∑(0, 1, 2, 8, 9, 10, 11), uses minterms
o F(w, x, y, z) = π(3, 4, 5, 6, 7, 12, 13, 14, 15), uses maxterms
➢ If you are given minterms, fill in 1’s for the minterms and then fill the
remaining cells with 0’s
➢ If you are given maxterms, fill in 0’s for the maxterms and then fill the
remaining cells with 1’s
➢ For SOP simplification, solve the map for the 1’s
➢ For POS simplification, solve the map for the 0’s to get complemented
function. Taking the complement of this complemented function we obtain
function in POS form
Fall 2023 18
 Don’t Care Conditions
• So far, we have always assumed that all combinations of the
input values are necessary in our expressions.
• Sometimes there are unspecified combinations within a
function.
➢ For example, four bit binary coded decimal code has six
combinations that are not used.
• Functions that have unspecified outputs for some input
combinations are called incompletely specified functions.
➢ These are called don’t care conditions because in most
applications, we do not care what the specification of the
combination is and not concerned about the function output
for these combinations..

Fall 2023 19
 Indicating Don’t Care Conditions
• A don’t care condition cannot be specified with a 1 because it
would require the function to always be 1 for the combination.
• Likewise, a don’t care condition cannot be specified with a 0
because it would require the function to always be 0 for the
combination.
• To specify don’t care conditions in a map, we use the letter ‘x’ or
‘d’.
➢ When we choose adjacent squares to simplify the map, the
don’t care minterms can be assumed to be 0 or 1, whichever
leads to the simplest expression.

Fall 2023 20
 Simplification with Don’t Care Conditions
• Example 3.9: Simplify the Boolean function: F (w,x,y,z) = ∑ (1,3,5,9,13)+∑ (0,2,7)
m d

F1 = w′x′+y′z = ∑m(0, 1, 2, 3, 5, 9, 13)

F2 = w′z+y′z = ∑m(1, 3, 5, 7, 9, 13)
Fall 2023 21
More Examples with Don’t Care

CD
00 01 11 10
AB
00 0 1 0 0
01 x x x 1 F=ACD+B+AC
11 1 1 1 x
10 x 0 1 1
CD
00 01 11 10
AB
00 0 1 0 0
01 x x x 1 F=ABCD+ABC+BC+AC
11 1 1 1 x
10 x 0 1 1
Fall 2023 22
The End

Fall 2023 23