Digital Logic and System Design

(CSE 1823)
Unit- II
Minimization Techniques
Lecture- 1
Map Method

Dr. Md. Shafiqul Islam

Professor, CSE, DUET, Gazipur

Slide Courtesy: Mustafa Kemal Uyguroğlu

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-1
 Motivation
 Microelectronic technologies have revolutionized our world: cell
phones, internet, rapid advances in medicine, etc.
 The semiconductor industry has grown from $33 billion in 1987
to $468.78 billion in 2018.
 Gordon Moore, 1929 -
 Robert Noyce, 1927 – 1990
 Cofounded Intel in 1968 with Robert
 Nicknamed “Mayor of Silicon Valley” Noyce.
 Cofounded Fairchild Semiconductor in 1957  Moore’s Law: the number of
 Cofounded Intel in 1968 transistors on a computer chip doubles
 Co-invented the integrated circuit every year (observed in 1965)
 Since 1975, transistor counts have
doubled every two years.

 Source: https://www.statista.com/statistics/266973/global-semiconductor-sales-since-1988/

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-2
 Outline of Unit- II (Lecture-1)

 Basic Theorems and Properties of Boolean Algebra

 The Map Method
 Two- and Three- Variable Maps
 Four-Variable Map
 Five-Variable Map

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-3
 Basic Theorems and Properties of Boolean Algebra

 Duality Principle
 if an expression is valid in Boolean algebra, then the dual of that
expression is also valid.
 To form the dual of an expression:
 replace all + operators with · operators,
 all · operators with + operators,
 all 1’s with 0’s, and all 0’s with 1’s.
 Form the dual of the expression
 x + (yz) = (x + y)(x + z)
 Following the replacement rules…
 x(y + z) = xy + xz
 Take care not to alter the location of the parentheses if they are present.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-4
 Basic Theorems and Properties of Boolean Algebra

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-5
 Basic Theorems and Properties of Boolean Algebra

 What is a theorem?
 A formula or statement that is derived from postulates (or other proven
theorems)
 Basic theorems of Boolean algebra
 Theorem 1 (a): x + x = x (b): x · x = x
 Looks straightforward, but needs to be proven!
 Theorem 1 (a) show that x + x = x. Huntington’s postulates
L. H. S = x + x
Post. 1:
closure
= (x + x) ·1 by 2(b) Post. 2:
(a) x+0=x, (b) x·1= x
= (x + x)(x + x′) by 5(a) Post. 3:
(a) x+y=y+x, (b) x·y=y·x
Post. 4:
(a) x(y+z) = xy + xz,
= x + xx′ by 4(b) (b) x+yz = (x+y)(x+z)
=x+0 by 5(b) Post. 5: (a) x+x’=1, (b) x·x’=0

=x by 2(a)
= R. H. S (Proved)
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-6
 Basic Theorems and Properties of Boolean Algebra
 Theorem 1 (b) show that x  x = x. Huntington’s postulates +
L. H. S = x  x
Post. 1:
closure
= xx + 0 by 2(a) Post. 2:
(a) x+0=x, (b) x·1= x
= xx + xx′ by 5(b) Post. 3:
(a) x+y=y+x, (b) x·y=y·x
Post. 4:
(a) x(y+z) = xy + xz,
= x(x + x′) by 4(a) (b) x+yz = (x+y)(x+z)
=x1 by 5(a) Post. 5: (a) x+x’=1, (b) x·x’=0
The. 1: (a) x + x = x
=x by 2(b)
= R. H. S (Proved)
Huntington’s postulates (5) +
 Theorem 2 (a) show that x +1 = 1. Theorem (1)
=x+1
= 1．(x + 1) by 2(b)
=(x + x′)(x + 1) by 5(a)
= x + x′ 1 by 4(b)
= x + x′ by 2(b)
=1 by 5(a)
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-7
 Basic Theorems and Properties of Boolean Algebra
 Theorem 2(b): x．0 = 0 by duality Huntington’s postulates (5) +
 Theorem 3: (x) = x Theorem (1 + 2(a))

 Postulate 5 defines the complement of x

 x + x = 1 Huntington’s postulates (5) +
Theorem (1 + 2)
 x  x = 0
 The complement of x is x and is also (x).
 Theorem 6(a): x + xy = x
x + xy = x．1 + xy by 2(b)
= x (1 + y) by 4(a)
= x (y + 1) by 3(a)
= x．1 by Th. 2(a)
 By means of truth table
=x by 2(b)
(another way to proof )
 Theorem 6(b): x (x + y) = x by duality

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-8
 Basic Theorems and Properties of Boolean Algebra

 Absorption theorem proof by truth table:

6(a) 6(b)

x y xy x + xy x+y x(x + y)
0 0 0 0 0 0

0 1 0 0 1 0

1 0 0 1 1 1

1 1 1 1 1 1

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-9
 Basic Theorems and Properties of Boolean Algebra

 DeMorgan’s Theorem
 Theorem 5(a): (x + y) = xy
 Theorem 5(b): (xy) = x + y
 By means of truth table

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-10
 Basic Theorems and Properties of Boolean Algebra
 Consensus Theorem
xy + xz + yz = xy + xz
1.

2. (x + y)  (x + z)  (y + z) = (x + y)  (x + z)  (dual)

 Proof
xy + xz + yz = xy + xz + (x + x) yz
= xy + xz + xyz + xyz
= (xy + xyz) + (xz + xzy)
= xy + xz
 The operator precedence for evaluating Boolean Expression is
 Parentheses
 NOT
 AND
 OR

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-11
 The Map Method
 Gate-level minimization refers to the design task of finding an
optimal gate-level implementation of Boolean functions
describing a digital circuit.
 The complexity of the digital logic gates
 The complexity of the algebraic expression
 Logic minimization
 Algebraic approaches: lacking of specific rules
 The Karnaugh map or K-Map
 First introduce by Veitch then modified by Karnaugh
 A simple straight forward procedure
 A pictorial form of a truth table
 Applicable if the no. of variables < 7

 A diagram made up of squares

 Each square represents one minterm
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-12
 The Map Method
 Boolean function (Review)
 Sum of minterms
 Sum of products (or product of sum) in the simplest form
 A minimum number of terms
 A minimum number of literals
 The simplified expression may not be unique

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-13
 Two- and Three- Variable Maps
 A two-variable map
 Four minterms
 x' = row 0; x = row 1
 y' = column 0; y = column 1
 A truth table in square diagram
 Fig. 3.2(a): xy = m3
 Fig. 3.2(b): x+y = x'y+ xy' + xy = m1+m2+m3

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-14
 Two- and Three- Variable Maps
 A three-variable map
 For 3 binary variables.
 2n = 8 minterms.
 Map consists of 8 squares.
 Minterms are not arranged in a binary
sequence.
 Only one bit changes in value from
one adjacent column to the next.
 Any two adjacent squares in the map
differ by only on variable
 Primed in one square and unprimed in
the other
 e.g., m5 and m7 can be simplified
 m5+ m7 = xy'z + xyz = xz (y'+y) = xz

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-15
 Two- and Three- Variable Maps
 m0 and m2 (m4 and m6) are adjacent
 m0+ m2 = x'y'z' + x'yz' = x'z' (y'+y) = x'z'
 m4+ m6 = xy'z' + xyz' = xz' (y'+y) = xz'

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-16
 Two- and Three- Variable Maps
 Example 3.1: Simplify the Boolean function F(x, y, z) = S(2, 3, 4, 5)
F(x, y, z) = S(2, 3, 4, 5) = x'y + xy'
y

yz 00 01 11 10
x
m0 m1 m3 m2
0 1 1
m4 m5 m7 m6
x 1 1 1

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-17
 Two- and Three- Variable Maps
 Example 3.2: Simplify F(x, y, z) = S(3, 4, 6, 7)
 F(x, y, z) = S(3, 4, 6, 7) = yz+ xz'

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-18
 Two- and Three- Variable Maps
 Consider four adjacent squares in the three-variable map.
 Any such combination represents the logical sum of four
minterms and results in an expression of only one literal.
 The number of adjacent squares that may be combined
 power of two
 1,2,4 and 8.
 Larger number of adjacent squares
 Product term with fewer literal

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-19
 Two- and Three- Variable Maps
 m0+m2+m4+m6 = x'y'z'+x'yz'+xy'z'+xyz' = x'z'(y'+y) +xz'(y'+y) = x'z' + xz'
= z'
 m1+m3+m5+m7 = x'y'z+x'yz+xy'z+xyz =x'z(y'+y) + xz(y'+y) =x'z + xz = z

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-20
 Two- and Three- Variable Maps
 1 square represents 1 minterm
 A Term of 3 literals.
 2 adjacent squares
 A term of 2 literals.
 4 adjacent squares
 A term of 1 literal.
 8 adjacent squares
 Entire map
 Function F = 1

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-21
 Two- and Three- Variable Maps
 Example 3.3: Simplify F(x, y, z) = S(0, 2, 4, 5, 6)
 F(x, y, z) = S(0, 2, 4, 5, 6) = z'+ xy'

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-22
 Two- and Three- Variable Maps
 If a function is not expressed in sum of minterms
 Use the map to obtain the minterms
 Simplify the function and find the minimum number of terms.
 Make sure that the algebraic expression is in sum of products form.
 Example 3.4: Let F = A'C + A'B + AB'C + BC
a) Express it in sum of minterms.
b) Find the minimal sum of products expression.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-23
 Four-Variable Map
 The map
 16 minterms
 Combinations of 2, 4, 8, and 16 adjacent squares

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-24
 Four-Variable Map
 Minimization of four-variable  8 adjacent squares
Boolean function is similar to  A term of 1 literal.
three-variable functions.  16 adjacent squares
 Adjacent squares are defined to  Entire map
be squares next to each other.  Function F = 1
 Ex: m0 and m2, m3 and m11.
 1 square represents 1 minterm
 A Term of 4 literals.
 2 adjacent squares
 A term of 3 literals.
 4 adjacent squares
 A term of 2 literal.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-25
 Four-Variable Map
 Example 3.5: Simplify F(w, x, y, z) = S(0, 1, 2, 4, 5, 6, 8, 9, 12, 13,
14)
F(w, x, y, z) = y' + w'z' + xz'
y

yz 00 01 11 10
wx
m0 m1 m3 m2
00 1 1 1
m4 m5 m7 m6
01 1 1 1
x
11 m12
1 m13 1 m15 m14
1
w
m8 m9 m11 m10
10 1 1
z
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-26
 Four-Variable Map
 Example 3-6: Simplify F = ABC + BCD + ABCD + ABC

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-27
 Four-Variable Map
 Prime Implicants
 A prime implicant: a product term obtained by combining the maximum
possible number of adjacent squares (combining all possible maximum
numbers of squares).
 Essential P.I.: a minterm is covered by only one prime implicant.
 The essential P.I. must be included.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-28
 Four-Variable Map
 Consider F(A, B, C, D) = Σ(0, 2, 3, 5, 7, 8, 9, 10, 11, 13, 15)

Essential prime implicants Prime implicants CD, B′C,

BD and B′D′ AD, and AB′

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-29
 Five-Variable Map

 Maps for more than four variables becomes complicated.

 A five-variable map needs 32 squares and a six-variable map
needs 64 squares.
 When the number of variables becomes large,
 The number of squares becomes excessively large,
 The geometry for combining adjacent squares becomes more
involved.
 Five-variable map: two four-variable map (one on the top of the
other).

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-30
 Five-Variable Map

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-31
 Five-Variable Map

 Each four-variable map retains the previously defined adjacency

when taken separately.
 Each square in the A = 0 map is a adjacent to the corresponding
square in the A = 1.
 Ex: m4 is adjacent to m20 and m15 to m31.
 For six-variable map 4 x four-variable maps needed to obtain the
required 64 squares.
 Variables > 6 need to many squares and are impractical to use.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-32
 Five-Variable Map

 Table 3.1 shows the relationship between the number of adjacent

squares and the number of literals in the term.

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-33
 Five-Variable Map

 Example 3.7: Simplify F = S(0, 2, 4, 6, 9, 13, 21, 23, 25, 29, 31)

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-34
 Five-Variable Map

 Another Map for Example 3-7

Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-35
Dr. Md. Shafiqul Islam, Professor, Dept. of CSE, DUET, Gazipur Digital Logic and System Design Lecture-1-36