CONTENTS

Module-2 (Part-1)
 Gate Level minimization -SOP and POS minimization
 K-maps 4 and 5-variables
 Don’t care logic

1
Dr P Monica , Asst. Prof , VIT Bhopal Combinational logic design
 Gate Level Minimization

Combinational logic design 2

Dr P Monica , Asst. Prof , VIT Bhopal
 GATE LEVEL MINIMIZATION

 Gate-level minimization is the design task of finding an optimal gate-level implementation of

the Boolean functions describing a digital circuit.
 As discussed earlier that algebraic method is not sufficient enough to find out whether a given
expression can be simplified or not.
 To avoid the above problem, Karnaugh’s Map or K-map method is developed to simplify a
Boolean expression.
 It is a graphical representation of Boolean algebra.
 The simplified expressions produced by the map are always in one of the two standard
forms:
sum of products or product of sums.
 This is another way to represent the truth table in which each block represents one
minterm.
Combinational logic design 3
Dr P Monica , Asst. Prof , VIT Bhopal
 Karnaugh Map

Karnaugh map is a graphical representation of the logic system.

It can be drawn directly from either minterm (sum-of-products) or maxterm (product-of-sums)

Boolean expressions.

Minterm when your Boolean expression or function is giving output ‘1’

and Maxterms when your Boolean expression or function is giving output logic ‘0’

Combinational logic design 4

Dr P Monica , Asst. Prof , VIT Bhopal
 Construction of K-Map

An n variable Karnaugh Map has 2n squares, and each possible input is allotted a square. Squares
are also called cell.

In the case of minterm, In K-Map we place a ‘0’ in all those squares for which the output is ‘1’.
Also, the extreme rows and extreme columns are considered adjacent.

Combinational logic design 5

Dr P Monica , Asst. Prof , VIT Bhopal
 Rules for simplification of K-Map

Rule 1: If you are doing with minterms, put a 1 in all specified minterms position.
Rule 2: Group all adjacent 1s, Different types of groups we can form : Lone (1), Pair (2),
Quad (4), Octet (8), .. (all are in power of two form).
Rule 3: Groups may be horizontal or vertical but not diagonal
Rule 4: Each group should be as large as possible and the number of groups should be
as few as possible.
Rule 5: Each cell containing a 1 must be in at least one group.
•We can either group 0’s with 0’s or 1’s with 1’s but we can not group 0’s and 1’s together.
•X representing don’t care can be grouped with 0’s as well as 1’s.
Rule 6: Groups may overlap
Rule 7: Extreme rows and columns are adjacent.

Combinational logic design 6

Dr P Monica , Asst. Prof , VIT Bhopal
 Cell Adjacency

The designation of adjacent rows and adjacent columns should be the same except for
one of the literal being complemented.

Easy way you can say that, in K-Map, Only 1 variable should be change in the adjacent cell
(rows and column).

A’B’ and AB’ can be adjacent cell because only one variable (A) has changed between the
two terms but A’B’ and AB cant be adjacent cell because two literals (both A and B) has
changed.
Similarly ,
A’B’C and AB’C  adjacent cell
A’B’C and A’BC’  not adjacent cell

Combinational logic design 8

Dr P Monica , Asst. Prof , VIT Bhopal
 2-VARIABLE K-
MAP

y'

Any two adjacent squares

x'
in the map differ by only
one variable, which is
primed in one square and
unprimed in the other.

2 Boolean variable Map contains 4 squares

One squares One minterm

Combinational logic design 9

Dr P Monica , Asst. Prof , VIT Bhopal
 2-VARIABLE K-

𝑭 = Σ(𝟏,
MAP

𝟐, 𝟑)
Example:
Simplify
y  Minterms 1 and 3 are paired in which only
0 1 y
x x is differed, thus, removed and the term
0 1 becomes y.
 Minterms 2 and 3 are paired in which only
1 1 1
y is differed, thus, removed and the term
becomes x.

𝑭=𝒙
x
+𝒚

Combinational logic design 10

Dr P Monica , Asst. Prof , VIT Bhopal
 2-VARIABLE K-

𝑭 = Σ(𝟏,
MAP

𝟐)
Example:
Simplify
y  The minterms does not make any pair or
0 1 x'y
x quad so can not be minimized.
0 1
𝑭 = 𝒙′ 𝒚
1 1 + 𝒙𝒚′

xy'

Combinational logic design 11

Dr P Monica , Asst. Prof , VIT Bhopal
 2-VARIABLE K-

𝑭 = Σ(𝟎,
MAP

𝟐)
Example:
Simplify
y  Minterms 0 and 2 are paired in which only
0 1
x x is differed, thus, removed and the term
0 1 becomes y'.

𝑭
= 𝒚′
1 1

y'

Combinational logic design 12

Dr P Monica , Asst. Prof , VIT Bhopal
 2-VARIABLE K-

𝑭 = Σ(𝟎,
MAP

𝟏, 𝟐, 𝟑)
Example:
Simplify
y  Minterms 0, 1, 2 and 3 formed a quad in
0 1
x which both x and y is differed, thus, both
0 1 1 can be removed, and the result becomes 1.

𝑭
=𝟏
1 1 1

Combinational logic design 13

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-
MAP

3 Boolean variable Map contains 8 squares

 The minterms are arranged, not in a binary sequence, but in a sequence similar to the Gray code. The
characteristic of this sequence is that only one-bit changes in value from one adjacent column to the
next.

Combinational logic design 14

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟐,
MAP

𝟑, 𝟒, 𝟓)
Example:
Simplify
 Minterms 2 and 3 are paired in which only
yz
00 01 11 10 x'y z is differed, thus, removed and the term
x
0 1 1 becomes x'y.
 Minterms 4 and 5 are paired in which only
1 1 1 z is differed, thus, removed and the term
becomes xy'.

xy' 𝑭 = 𝒙′ 𝒚
+ 𝒙𝒚′

Combinational logic design 15

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟑,
MAP

𝟓, 𝟔, 𝟕)
Example:
Simplify
yz  Minterms 3 and 7 are paired in which only x is
yz
00 01 11 10 differed, thus, removed and the term becomes yz.
x
 Minterms 5 and 7 are paired in which only y is
0 1
differed, thus, removed and the term becomes xz.
 Minterms 6 and 7 are paired in which only z is
1 1 1 1
differed, thus, removed and the term becomes xy.

xz xy 𝑭 = 𝒙𝒚 + 𝒚𝒛
+ 𝒙𝒛

Combinational logic design 16

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-MAP

Note:
 In certain cases, two squares in the map are considered to be adjacent even though they
don’t touch each other.

m0 & m2 Minterms are differed by only one variable

m4 & m6 i.e., m0 + m2 = x’z’ & m4 + m6 = xz’

 Any combination of 4 adjacent squares in the 3-variable map i.e., logical sum of 4 minterms
differed by 2 literals.
m0 , m1 , m 4 , m5
m0 , m1 , m2 , m3
m1 , m3 , m 5 , m7 Quads Bars m 0 , m2 , m 4 , m 6 Quad
m4 , m5 , m6 , m7
m2 , m3 , m6 , m 7

Combinational logic design 17

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟎,
MAP

𝟏, 𝟒, 𝟓)
Example:
Simplify

yz  Minterms 0, 1, 4 and 5 formed a quad in

00 01 11 10
x which both x and z are differed, thus, both
0 1 1 can be removed, and the result becomes y'.

1 1 𝑭
= 𝒚′
1

y'

Combinational logic design 18

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟎, 𝟏, 𝟐, 𝟑,
MAP

𝟓, 𝟕)
Example:
Simplify

x'  Minterms 1, 3, 5 and 7 formed a quad in

yz
00 01 11 10 which both x and y are differed, thus, both
x
0 1 1 1 1 can be removed, and the result becomes
z.
1 1 1  Minterms 0, 1, 2 and 3 formed a bar in
which both y and z are differed, thus,

𝑭 = 𝒙′
removed and the term becomes x'.
z
+𝒛

Combinational logic design 19

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-
MAP

Example: Simplify the Boolean function using K map,

𝑭 = 𝑨 ′ 𝑪 + 𝑨′𝑩 + 𝑨𝑩
′ 𝑪 + 𝑩𝑪
Solutio 𝑭 = 𝑨 𝑪 + 𝑨′𝑩 + 𝑨𝑩′ 𝑪 + 𝑩𝑪
′

= 𝑨′ 𝑩 + 𝑩′ 𝑪 + 𝑨′𝑩(𝑪 + 𝑪 ′ ) + 𝑨𝑩′ 𝑪 +
n:

(𝑨 + 𝑨′)𝑩𝑪

= 𝑨′ 𝑩𝑪 + 𝑨′𝑩′𝑪 + 𝑨′𝑩𝑪 + 𝑨′𝑩𝑪′ + 𝑨𝑩′ 𝑪

+ 𝑨𝑩𝑪 + 𝑨′ 𝑩𝑪

= 𝑨′ 𝑩𝑪 + 𝑨′𝑩′𝑪 + 𝑨′𝑩𝑪 + 𝑨′𝑩𝑪′ + 𝑨𝑩′ 𝑪

+ 𝑨𝑩𝑪 + 𝑨′ 𝑩𝑪

= 𝑨′ 𝑩𝑪 + 𝑨′𝑩′𝑪 + 𝑨′𝑩𝑪′ + 𝑨𝑩′ 𝑪 + 𝑨𝑩𝑪

Combinational logic design 20
Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ (𝟏, 𝟐,
MAP

𝟑, 𝟓, 𝟕)
Example: now simplify the Boolean function using K
map,
BC A'B  Minterms 1, 3, 5 and 7 formed a quad in which
00 01 11 10 both A and B are differed, thus, both can be
A
removed, and the result becomes C.
0 1 1  Minterms 2 and 3 are paired in which only C is
differed, thus, removed and the term
1 11 1 becomes A'B.

𝑭=𝑪
+ 𝑨′ 𝑩
C

Combinational logic design 21

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟎, 𝟐,
MAP

𝟒, 𝟓, 𝟔)
Example:
Simplify
 Minterms 0, 2, 4 and 6 formed a quad in which
yz
00 01 11 10 both x and y are differed, thus, both can be
x
1 removed, and the result becomes z'.
0 1
 Minterms 4 and 5 are paired in which only z is

1 1 1 1 differed, thus, removed and the term becomes

xy'.
𝑭 = 𝒛′
+ 𝒙𝒚′
xy' z'

Combinational logic design 22

Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟎, 𝟏, 𝟐,
MAP

𝟑, 𝟒, 𝟔, 𝟕)
Example:
Simplify  Minterms 0, 2, 4 and 6 formed a quad in which

yz x' both x and y are differed, thus, both can

00 01 11 10
x be removed, and the result becomes z'.
1 1 1 1  Minterms 0, 1, 2 and 3 formed a bar in
0
which

1 1 1 1 both y and z are differed, thus, removed and the

term becomes x’.
 Minterms 2, 3, 6 and 7 formed a quad in which
z' y both x and z are differed, thus, both can be
removed, and the result becomes y.

𝑭 = 𝒙′ + 𝒚 + 𝒛′
Combinational logic design 23
Dr P Monica , Asst. Prof , VIT Bhopal
 3-VARIABLE K-

𝑭 = Σ(𝟎, 𝟏, 𝟐, 𝟑,
MAP

𝟒, 𝟓, 𝟔, 𝟕)
Example:
Simplify

yz  Minterms 0, 1, 2, 3, 4, 5, 6, 7 form an octet,

00 01 11 10
x
thus the result becomes 1.
1 1 1 1
𝑭
0

1 1 1 1 1 =𝟏

Combinational logic design 24

Dr P Monica , Asst. Prof , VIT Bhopal
 4-VARIABLE K-
MAP

4 Boolean variable Map contains 16 squares

Combinational logic design 25

Dr P Monica , Asst. Prof , VIT Bhopal
5 variable K-map: We need to combine the digits from two maps if they are overlapping each other.

2 3

Combinational logic design

Dr P Monica , Asst. Prof , VIT Bhopal
 Summary

27

Combinational logic design 27

Dr P Monica , Asst. Prof , VIT Bhopal
Thank you