K - Map
DIGITAL ELECTRONICS
Copyright © 2014-2021 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
Download Testbook
K - Map
Karnaugh Map (K-Map)
The K-map is a method of simplifying Boolean algebra expressions.
The K-map reduces the need for extensive calculations.
K-map can be explained as ‘An array that contain 2n number of cells, where n is the number of variables in
the Boolean expression that is to be reduced or optimized.
K-Map Number of Cells
For two variables K-map 22 = 4
For three variables K-map 23 = 8
For Four variables K-map 24 = 16
For five variables K-map 25 = 32
NOTE:
In a Number of cells that can be grouped is always a power of 2 value.
K-map is used when output can be 0, 1, and X (don’t care)
Each square in the K-map represents one Minterm or Maxterm.
In the K-map, gray code representation is used.
K-map contains two types of methods-
i) SOP (Sum of product)
This produces logical expressions that contains OR of multiple AND terms.
Example: a̅b + c̅ d̅
ii) POS (Product of sum)
This produces logical expressions that contain AND of multiple OR terms.
Example: (a̅ + b). (c̅ + d̅)
DIGITAL ELECTRONICS | K - Map PAGE 2
Download Testbook
Rules
The K-Map uses the following rules-
Groups must not include any cell containing a zero for SOP while groups must NOT include any cell
containing a one for POS.
Group may be horizontal, vertical but NOT diagonal.
Group must contain 1, 2, 4, 8 or in general 2n cells i.e., if n = 1, a group will contain two 1’s since 2’ = 2. If n
= 2 a group will contain four 1’s since 22 = 4 & so on.
Group May overlap.
Groups may wrap around the table.
The left most cell in a row may be grouped with the rightmost cell & the top cell in a column may be
grouped with the bottom cell.
Priority of grouping-
Octel (group of 8 adjacent squares)
Quads (group of 4 adjacent squares)
Pairs (group of 2 adjacent squares)
Single term
Remove redundant groups.
Note:
Redundant group is a group whose all the cells are covered by Adjacent group.
Two-Variables K-Map
DIGITAL ELECTRONICS | K - Map PAGE 3
Download Testbook
Three Variables K-Map
Four - Variables K-Map
DIGITAL ELECTRONICS | K - Map PAGE 4
Download Testbook
Five - Variables K-Map
F (v, w, x, y, z)
Note:
The two functions are same, if the position of 1’s and 0’s are same in K-map while if the position of 1’s is
replaced with 0’s & 0’s place is replaced with 1’s then the function is COMPLEMENT to each other.
Don’t care (X) condition (DCC)
A function in which the output is NOT specified for certain inputs (i.e., unused input)
The output to be assumed logic 1 or logic 0 for the unused input. These inputs are known as Don’t care
conditions.
DIGITAL ELECTRONICS | K - Map PAGE 5
Download Testbook
Don’t care conditions provide additional simplification on the K-map.
It is NOT necessary to group the Don’t care conditions.
Implicant, Prime Implicant & Essential Prime
Implicant
Implicant
Every Min-term in SOP form or max-term in POS form in a Boolean function is termed as an Implicant.
Prime Implicant
All pairs that cannot be a part of any quad or all quads that cannot be a part of any octet in a K-Map are
termed as Prime implicants
Essential Prime Implicants
Those Prime implicants that covers atleast one min-term that cannot be covered by any other prime
imlicants are called Essential Prime implicants.
Non-Essential Prime Implicants
(Prime Implicant – Essential Prime Implicants) gives the Non-Essential Prime Implicant
Note:
In n-variable Boolean functions, maximum possible number of prime implicants is ≤ 2n-1
Hazard problems are eliminated by including redundant groups on the K-map.
DIGITAL ELECTRONICS | K - Map PAGE 6
