Topic: Karnaugh Map (PART-3:

4 Variables)
UNIT II: Boolean Algebra and
Minimization
Lecture No.: 15
 Four Variable Karnaugh Map
 There are sixteen minterms for four binary variables; therefore, the map
consists of sixteen squares.
NOTE:
 The minterms are arranged, not in a binary sequence, but in a sequence
similar to the Gray code.

Prepared By: Irfan Ahmad Pindoo 2

Four Variable Karnaugh Map

Prepared By: Irfan Ahmad Pindoo 3

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟒, 𝟓, 𝟔, 𝟖, 𝟗, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒 into POS form?

𝒚𝒛 𝒚𝒛 𝒚𝒛 𝒚𝒛
𝒘𝒙
𝒘𝒙
𝒘𝒙
𝒘𝒙

Prepared By: Irfan Ahmad Pindoo 4

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟒, 𝟓, 𝟔, 𝟖, 𝟗, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒 into POS form?

Prepared By: Irfan Ahmad Pindoo 5

 Four Variable Karnaugh Map

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 6

Four Variable Karnaugh Map

Prepared By: Irfan Ahmad Pindoo 7

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟓, 𝟖, 𝟗, 𝟏𝟎 into:
(1) SOP Form (2) POS form?

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 8

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟓, 𝟖, 𝟗, 𝟏𝟎 into:
(1) SOP Form (2) POS form?

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 9

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟓, 𝟖, 𝟗, 𝟏𝟎 into:
(1) SOP Form (2) POS form?

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 10

 Four Variable Karnaugh Map
Question: Simplify the Boolean function:
𝒇(𝒘, 𝒙, 𝒚, 𝒛) = 𝟎, 𝟏, 𝟐, 𝟓, 𝟖, 𝟗, 𝟏𝟎 into:
(1) SOP Form (2) POS form?

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 11

 Don’t Care conditions
• In practice, in some applications the function is not specified for certain
combinations of the variables.
• As an example, the four-bit binary code for the decimal digits has six combinations
that are not used and consequently are considered to be unspecified.
• In most applications, we simply don’t care what value is assumed by the function
for the unspecified minterms.
• For this reason, it is customary to call the unspecified minterms of a function
don’t-care conditions.
• These don’t-care conditions can be used on a map to provide further
simplification of the Boolean expression.
• Symbol of don’t care: X

Prepared By: Irfan Ahmad Pindoo 12

 Don’t Care conditions
Qsn: Implement the given function using K-Map:

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
QUIZ:
𝑨𝑩 It is important to cover all don’t cares
while creating a group.
A. TRUE
Prepared By: Irfan Ahmad Pindoo B. FALSE 13
 Don’t Care conditions
Qsn: Implement the given function using K-Map:

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 14

 NAND and NOR Implementation
• Digital circuits are frequently constructed with NAND or NOR gates rather
than with AND and OR gates. NAND and NOR gates are easier to fabricate
with electronic components and are the basic gates used in all IC digital logic
families.
• They are a universal gates because any logic circuit can be implemented
with them.

Prepared By: Irfan Ahmad Pindoo 15

NAND Implementation

Prepared By: Irfan Ahmad Pindoo 16

NOR Implementation

Prepared By: Irfan Ahmad Pindoo 17

 NAND and NOR Implementation
Question: Implement the Boolean function 𝒇(𝑨, 𝑩, 𝑪) = 𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟕 using
(a) NAND gates only.
(b) NOR gates only
(c) SOP form.
(d) POS form.

𝑩𝑪 𝑩𝑪 𝑩𝑪 𝑩𝑪
𝑨
𝑨

Prepared By: Irfan Ahmad Pindoo 18

Explanation Slide

Prepared By: Irfan Ahmad Pindoo 19

 NAND and NOR Implementation
Question: Implement the Boolean function 𝒇(𝑨, 𝑩, 𝑪) = 𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟕 using
(a) NAND gates only.
(b) NOR gates only
(c) SOP form.
(d) POS form.

𝑩𝑪 𝑩𝑪 𝑩𝑪 𝑩𝑪
𝑨
𝑨

Prepared By: Irfan Ahmad Pindoo 20

 Prime Implicants and Essential Prime Implicants
• Prime Implicants
A group made up of bunch of adjacent minterms which is allowed by
definition of K-Map are called prime implicants(PI) i.e. all possible groups
formed in K-Map.
• Essential Prime Implicants
These are those groups which cover atleast one minterm that can’t be
covered by any other prime implicant.
Essential prime implicants(EPI) are those prime implicants which always
appear in final solution.

Prepared By: Irfan Ahmad Pindoo 21

 Prime Implicants and Essential Prime Implicants
Question: Simplify the Boolean function 𝒇 𝑨, 𝑩, 𝑪 = 𝟎, 𝟏, 𝟐, 𝟔, 𝟕 using
K-Map?
QUIZ:

𝑩𝑪 𝑩𝑪 𝑩𝑪 𝑩𝑪 Number of PI and EPI in this question

are:
A. 2 and 4
𝑨 B. 3 and 2
C. 4 and 3
𝑨 D. 4 and 2

Prepared By: Irfan Ahmad Pindoo 22

 Prime Implicants and Essential Prime Implicants
Question: Identify PI and EPI in the Boolean function 𝒇 𝑨, 𝑩, 𝑪, 𝑫 =
𝟏, 𝟓, 𝟔, 𝟕, 𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟓 using K-Map?

𝑪𝑫 𝑪𝑫 𝑪𝑫 𝑪𝑫
𝑨𝑩
𝑨𝑩
𝑨𝑩
𝑨𝑩

Prepared By: Irfan Ahmad Pindoo 23