Gate Level Minimization-

Karnaugh Map Method

By,
Dr.Daggubati Sirisha
Understanding Minterms & Maxterms
 Gate Level Minimization-Karnaugh Map
Method
• We have established, need for simplification of Boolean Expression
• Introduced Boolean Algebraic rules for simplification/minimization of Boolean
Expression
• Difficulty in simplifying, used when number of variables are less.
• Another technique, which is graphical known as KARNAUGH Map Method.
 Karnaugh Map
• K map is a systematic method for simplifying Boolean expression
• In this technique information contained in TT or available in SOP /POS
form is represented in K map
• This method is used upto six variables
• Types of K-MAPS: depending on number of variable in the given
function, it can be
1.Two-variable
2.Three-variable
3.Four-variable
4.Five –variable
 A B Decimal
Two-variable K-MAP

0 0 0
•  Simplify the given function F= AB+AB’ using K-Map
0 1 1
• Simplify the given function F(A,B)= using K-Map 1 0 2

• Simplify the function specified in Truth Table A B F 1 1 3

0 0 0
Using K-map F= AB+AB’
0 1 0 11 10
• Two variable K-map 1 0 1 3 2

• It consist of squares; n=number of variables 1 1 1

𝑚
  0 𝑚
  1 Plotting a Boolean expression
On k-map
𝑚
  2 𝑚
  3 1 1
 Grouping of 1’s

• After Plotting a Boolean expression on a k-map, they are formed into

different groups depending on number of 1s adjacent to each other
• The 1s are generally formed into
1.Pair (2->1s)
2.Quads(4->1s)
3.Octets(8->1s)
4.Hextet(16->1s)
1 1 1 1 1 1
1 1 1 1
1 1
 A B Decimal
Two-variable K-MAP

0 0 0
•  Simplify the given function F= AB+AB’ using K-Map
0 1 1
• Simplify the given function F(A,B)= using K-Map 1 0 2

• Simplify the function specified in Truth Table A B F 1 1 3

0 0 0
Using K-map F= AB+AB’
0 1 0 11 10
• Two variable K-map 1 0 1 3 2

• It consist of squares; n=number of variables 1 1 1

2) Grouping of 1s

𝑚
  0 𝑚
  1

𝑚
  2 𝑚
  3 1 1

1) Plotting a Boolean expression

On k-map
1. Simplify the function specified in Truth Table Using K-map

1
F(A,B)=B

  2. Simplify the given function F(A,B)= using K-Map

A B Decimal
0 0 0
1 1
1 1 0 1 1
F(A,B)=A’
1 0 2
1 1 3
3.Simplify the given function F= A’B+AB+AB’ using K-Map

2
1 1
F(A,B)=A+B
1 1 1 1
1

4.Simplify the given function F= A’B+A’B’+AB’ using K-Map

1. QUAD(4-1s) x
2. Pair(2-1s)-YES
1 1 1 1 3. Above-YES
F(A,B)=A’+B’ 4. Below-NO
1 1 5. Left side-YES
6. Rightside-NO
3.Simplify the given function F= A’B+AB’ using K-Map

1. QUAD(4-1s) x
2. Pair(2-1s)-X
• Above-NO
1 1 F(A,B)=A’B+AB’ • Below-NO
• Left side-NO
1 1 • Rightside-NO
3. SINGLE

4.Simplify the given function F= A’B+A’B’+AB’+AB using K-Map

1. QUAD(4-1s) YES

1 1
1 1
1 1 F(A,B)=1
1 1
 Deci A B C
Three-variable K-MAP
mal 4 2 1
•  Three variable K-map 0 0 0 0
1 0 0 1
• It consist of squares; n=number of variables
2 0 1 0
3 0 1 1
4 1 0 0
0 1 3 2 5 1 0 1
4 5 7 6 6 1 1 0
7 1 1 1

1. Note the sequence of numbers across the top of the map.

𝑚 𝑚 𝑚 𝑚 2. It is not in binary sequence which would be 00, 01, 10, 11.
 0  1  3  2
3. It is 00, 01, 11 10, which is Gray code sequence.
𝑚
 4 𝑚
 5 𝑚
 7 𝑚
 6 4. Gray code sequence only changes one binary bit as we go from one
number to the next in the sequence, unlike binary.
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map A’B’(C’+C)
A’B’
1. Octets(8-
>1s)==x
2. QUAD(4-1s)
==no
3. Pair(2-
1s)==yes
4. Single-1s
• 2.

1 1
F=A’B’
 Three-variable K-MAP

• Simplify the given function F= u using K-Map

• Three variable K-map
1. Octets(8->1s)-
NO
2. QUAD(4-1s)-
YES
3. Pair(2-1s)
4. Single-1s

1. Octets(8->1s)-NO
1 1 1 1 2. QUAD(4-1s)-YES =ONLY ONE VARIABLE
F(A,B,C)=A’ WILL COME AS OUTPUT
3. Pair(2-1s)
4. Single-1s
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map
1. Octets(8->1s)-
NO
2. QUAD(4-1s)-
YES
3. Pair(2-1s)
4. Single-1s
B’C BC

1 1
F(A,B,C)=C ONLY ONE VARIABLE WILL COME AS OUTPUT
1 1
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map 000 001 011 010 111 110

1. Octets(8->1s)--
NO
2. QUAD(4-1s)
--YES
3. Pair(2-1s)
4. Single-1s
BC BC’

1 1 1 1
F(A,B,C)=A’+B
1 1
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map 011 010 111 110

1. Octets(8->1s)-
NO
2. QUAD(4-1s)
-YES
3. Pair(2-1s)
4. Single-1s

1 1
F(A,B,C)=B
1 1
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map 000 100 010 110

1. Octets(8->1s)-
NO
2. QUAD(4-1s)
-YES
3. Pair(2-1s)
4. Single-1s

1 1

1 1
 Three-variable K-MAP

• Simplify the given function F= using K-Map

• Three variable K-map 000 001 011 010 100 110

1. Octets(8->1s)-NO
2. QUAD(4-1s) –YES===2NOs above,
rolled side
3. Pair(2-1s)
4. Single-1s

1 1 1 1

1 1
 Three-variable K-MAP

•  Simplify the given function F(A,B,C)= using K-Map

• Three variable K-map 1. Octets(8->1s)

-YES
2. QUAD(4-1s)
3. Pair(2-1s)
4. Single-1s

1 1 1 1
F(A,B,C)=1
1 1 1 1
 Three-variable K-MAP

•  Simplify the given function F(A,B,C)= using K-Map

• Three variable K-map 1. Octets(8->1s) --NO

2. QUAD(4-1s)--NO
3. Pair(2-1s)--YES
4. Single-1s--YES

When I group
• OCTET=1
1 1 F(A,B,C)=A’B’+ABC • QUAD=1 VARIABLE
• PAIR=2 VARIABLEs
1 • SINGLE=3VARIABLES
 1. Octets(8->1s)
B’C BC BC’ 2. QUAD(4-1s)
3. Pair(2-1s)
4. Single-1s

F=AC+BC+AB

F=B’C+A’C F=BC’+AC’+A’B’C F=C+B F=A+B

1. Octets(8->1s)
2. QUAD(4-1s)
3. Pair(2-1s)
4. Single-1s
 Deci A B C D
Four-variable K-MAP mal 8 4 2 1
•  Four variable K-map 0 0 0 0 0

• It consist of squares; n=number of variables 1 0 0 0 1

2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
10 1 0 1 0
11 1 0 1 1
12 1 1 0 0
1. Note the sequence of numbers across the top of the map.
2. It is not in binary sequence which would be 00, 01, 10, 11. 13 1 1 0 1
3. It is 00, 01, 11 10, which is Gray code sequence. 14 1 1 1 0
4. Gray code sequence only changes one binary bit as we go from one 15 1 1 1 1
number to the next in the sequence, unlike binary.
 Four-variable K-MAP

•  Four variable K-map

1. Hextet(16->1s)=1
• It consist of squares; n=number of variables 2. Octets(8->1s)
3. QUAD(4-1s)
 Simplify the given function F(A,B)= using K-Map 4. Pair(2-1s)
5. Single-1s

1 1 1 1

1 1 1 1

1 1 1 1

1 1 1 1

F(A,B,C,D)=1
 Left Side Right Side Vertical Rolling-cylinder Centre

1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1

1. Octets(8->1s)

1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1

Above below Rolling-Top-bottom

Centre
Horizontal cylinder
1 1 1 1 1 1 1 1

1 1 1 1 1 1

1 1 1 1 1 1
1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1
1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1
 0011 0111 1111 1011 1100 1101 1110

1. Hextet(16->1s)=NO A’B’C’D’+A’B’C’D+A’B’CD+A’B’CD’+BC’D’(A+A’)+BCD’(A+A’)
2. Octets(8->1s) =NO +AB’C’D’+AB’D(C+C’)+AB’CD’
3. QUAD(4-1s) =YES
4. Pair(2-1s) A’B’C’D’+A’B’C’D+A’B’CD+A’B’CD’+ABC’D’+A’BC’D’+ABCD’
5. Single-1s +A’BCD’+AB’C’D’+AB’CD+AB’C’D+AB’CD’

F(ABCD)=D’+B’
F(ABCD)=CD+AB
1. Hextet(16->1s)=NO
IF I GROUP A QUAD=2 VARIABLE O/P 2. Octets(8->1s) =YES
3. QUAD(4-1s) =NO
IF I GROUP A OCTET= VARIABLE O/P 4. Pair(2-1s)
5. Single-1s
F(A,B,C,D)=B’D’
F(A,B,C,D)=B’
 1

F(A,B,C,D)=B’C’D’+A’B’D’+ABCD

F=B’C’D’+A’C’D+BCD+ACD’
IF I GROUP A PAIR= 3 VARIABLE O/P
F=A’B’C’+A’BD+ABC+AB’D’
IF I GROUP A QUAD=2 VARIABLE O/P

IF I GROUP A OCTET= VARIABLE O/P

F(A,B,C,D)=A’C’+A’D+BC’+BD IF I GROUP A QUAD=2 VARIABLE O/P
F(A,B,C,D)=C’D’+CD+ABC’ F(A,B,C,D)=C’D’+CD+ABD
Understanding Minterms & Maxterms
K-Map Simplification Product of Sums
   F=

1 1 1

1
Minimize SOP
Minimize POS
Example 1: Minimize the given Boolean Expression by using the four-
16-1s-no
variable K-Map. Octect-8-1s-no
F (A, B, C, D) = Σ m (1, 5, 6, 12, 13, 14) + d (2, 4). Quad-4-1s
Pair-2-1s
Single

X=dontcare
U can use X either as
1 1=SOP
0=POS

1
Example 2: Minimize the given Boolean Expression by using
the four-variable K-Map.
F (A, B, C, D) = Σ m (0,3,2,5,6,8,9) + d (12, 13,15,14,11,10).

F(A,B,C,D)=
A+B’D’+CD’+CB’+BC’D
1 X X X

0 0 0 0

0 1 1 X

0 X X 1
SOP
POS
Assignment:
Minimise the following function in SOP and POS form using K-
Maps: 
•  Given function, F = Σ (0, 4, 6, 8, 10, 15) =SOP and POS
• Given function, F = Σ (0, 1, 3, 5, 6, 9, 11, 12, 13, 15)
• Given function, F =
• Given function, F = Σ (0, 3, 4, 6, 7, 9, 12, 14, 15)
• Given function, F =
• F(A, B, C, D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(3, 5, 12)
Given function, F = Σm (0, 4, 6, 8, 10, 15) +d(12,13) =SOP and POS

1 1

X X 1

1 1
Given function, F = Σm (0, 4, 6, 8, 10, 15) +d(12,13) =SOP and POS

0 0 0

F(A,B,C,D)=A’D+B’D+A’B’C+ABD’
0 0

X X 0

0 0
Simplifying K map using Don’tcares
 
F(A,B,C,D)=
• C’D+A’D

1 1

1 1 X

X X

1
Implicants:3
PI:3
EPI:2
NEPI:1
 Implicants: The group of 1’s is called implicants
Or Any group of 1’s can be considered to be implicant.
Eg:1,2,4,8,16
• No of Implicants:3

1 1

1
1

1
Prime Implicants: Largest possible group of 1
No of prime Implicants:3

1 1

1
1

1 1
Essential Prime Implicants: In largest possible group of
1,there is at least single 1 which cannot be combined

1 1

1
1

1 1