K Maps

By
Prof. S. K. Dash
School Of Electronics Engineering
KIIT Deemed to be University
 K Maps
 Boolean algebra helps us simplify expressions and circuits
 Karnaugh Map: A graphical technique for simplifying a Boolean expression into either
form:
 minimal sum of products (MSP)
 minimal product of sums (MPS)
 Goal of the simplification.
 There are a minimal number of product/sum terms
 Each term has a minimal number of literals
 Circuit-wise, this leads to a minimal two-level implementation

KIIT Deemed to be University

 K Maps
 A two-variable function has four possible minterms. We can re-arrange
these minterms into a Karnaugh map.

 Now we can easily see which minterms contain common literals

 Minterms on the left and right sides contain y’ and y respectively
 Minterms in the top and bottom rows contain x’ and x respectively

KIIT Deemed to be University

 K Maps
A B F1 F2 F3 F4 F5 F6 F7 f8
0 0 1 1 1 1 0 0 0 0
0 1 1 1 0 1 0 1 0 1
1 0 1 0 1 1 1 0 0 1
1 1 1 0 0 0 1 1 1 0

B
0 1
A

KIIT Deemed to be University

 K Maps
 Reduce the expression f = (A+B)(A+B’)(A’+B’)
B

0 1
A
0 0 0

1
1 0

 So f = A . B’

KIIT Deemed to be University

 K Maps
For a three-variable expression with inputs x, y, z, the
arrangement of minterms is more tricky:

KIIT Deemed to be University

 K Maps
Minimize the expression f = A’B’C’ + A’BC’ + AB’C’ + ABC’ + A’BC
BC 00 01 11 10
A
1 0 1 1
0

1 1 0 0 1

For quad , C’
For pair, A’B
So f = A’B + C’ .

KIIT Deemed to be University

 K Maps
 Minimize the expression f = A’B’C’ + A’B’C + A’BC + A’BC’ + AB’C+ABC
BC 00 01 11 10
A
1 1 1 1
0

1 0 1 1 0

For quad 1: A’
For quad 2 :C
So f = A’ + C

KIIT Deemed to be University

 K Maps
 Minimize the expression f = A’B’C’ + A’B’C + ABC + ABC’
BC 00 01 11 10
A
1 1 0 0
0

1 0 0 1 1

For pair 1 : A’B’

For pair 2: AB
So f = A’B’ + AB

KIIT Deemed to be University

 K Maps
Minimize the expression f = Σm(1,2,5,6,7)
BC 00 01 11 10
A
0 1 0 1
0

1 0 1 1 1
For pair 1: B’C
For pair 2: BC’
For pair 3: AC
For pair 4: AB
Either we can take pair 3 or pair 4, but not the both. As using 3 pairs all
1’s are covered.
f = B’C + BC’ + AB 0r B’C + BC’ + AC
KIIT Deemed to be University
 K Maps
Minimize the expression f = Σm(1,2,5,6,7) in pos form.
BC 00 01 11 10
A
0 1 0 1
0

1 0 1 1 1

For pair, B + C
For single cell, (A + B’ + C’)

So f= (B + C) (A + B’ + C’)

KIIT Deemed to be University

 K Maps
Reduce the expression f = Σm(1,2,4,6,7) & implement using
universal gate.
BC 00 01 11 10

A
0 1 0 1
0

1 0 1 1
1

Pair 1: BC’ Pair 2: AB Pair 3:AC’ Single cell: A’B’C

So f = BC’ + AB + AC’ + A’B’C
In POS, f = (A+B+C) ( A+B’+C’) (A’ + B + C’)
For SOP use NAND gates & POS use NOR gates.

KIIT Deemed to be University

 Four Variable K Map
CD
00 01 11 10
AB
m0 m1 m3 m2
00

m4 m5 m7 m6
01

m12 m13 m15 m14

11

m8 m9 m11 m10
10

Try to make combination of 16 cells, then 8 cell, 4 cell & 2 cell.

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = Σm(0,1,2,3,5,7,8,9,10,11,13,15) .

CD
00 01 11 10
AB
1 1 1 1
00

1 1
01

1 1
11

1 1 1 1
10

For octet 1: B’ & octet 2: D , so f = B’ + D.

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = Σm(0,2,4,6,7,8,9,10,12,13,14) .

CD
00 01 11 10
AB
1 1
00

1 1 1
01

1 1 1
11

1 1 1
10

For octet 1: D’ & quad 1: AC’ , pair 1: A’BC , so f = D’ + AC’ + A’BC.

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = ΠM(2,8,9,10,11,12,14) & implement using
universal gate.
CD
00 01 11 10
AB
1 1 1
00

1 1 1 1
01

1 1
11

10

So f = A’B + A’C’ + A’D + BD

KIIT Deemed to be University

 Contd.
.

CD
00 01 11 10
AB
1 1 1 0
00

1 1 1 1
01

0 1 1 0
11

0 0 0 0
10

So f = (A’+B) ( A’+ D)(B + C’ + D)

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = Σm(3,4,5,7,9,13,14,15)

CD
00 01 11 10
AB
1
00

1 1 1
01

1 1 1
11

1
10

So f = A’BC’ + AC’D + A’CD + ABC

KIIT Deemed to be University

 Don’t Care
Sometimes for a logic circuit for certain input
combination value of output is not specified.
This is because either input combinations are invalid
or precise value of output is of no consequence.
These combinations are called as don’t care
combination.
It is denoted by x, d or Φ.
Consider as x as 1 in sop if it is helpful in reduction,
otherwise consider as 0.
Consider as x as 0 in pos if it is helpful in reduction,
otherwise consider as 1.

KIIT Deemed to be University

 Don’t Care Condition
Reduce the expression f = Σm(1,5,6,12,13,14) + d(2,4)

CD
00 01 11 10
AB
0 1 0 x
00

x 1 0 1
01

1 1 0 1
11

0 0 0 0
10

So f = BC’ + BD’ + A’C’D

KIIT Deemed to be University

 Contd.
Reduce the expression f = Σm(1,5,6,12,13,14) + d(2,4)

CD
00 01 11 10
AB
0 0 x
00

x 0
01

0
11

0 0 0 0
10

So f = (B + D) (A’ + B) ( C’ + D’ )

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = ΠM(0,1,2,5,7,8,9,10,13,15). Πd(3,4,6)

CD
00 01 11 10
AB
0 0 x 0
00

x 0 0 x
01

0 0
11

0 0 0
10

So f =(B’ + D’)(B+D)(C+D’) or (B’ + D’)(B+D)(B+C)

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = A’ + AB + ABD’ + AB’D’ + C

CD
00 01 11 10
AB
1 1 1 1
00

1 1 1 1
01

1 1 1 1
11

1 1 1
10

So f = A’ + B + C + D’

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = Σm(2,3,7,10,11,14) + d(1,5,15)

RS
00 01 11 10
PQ
x 1 1
00

x 1
01

x 1
11

1 1
10

So f =Q’R + PR +RS or Q’R + PR + P’S

KIIT Deemed to be University

 Four Variable K Map
Reduce the expression f = Σm(2,3,7,10,11,14) + d(1,5,15)

RS
00 01 11 10
PQ
0 x
00

0 x 0
01

0 0 x
11

0 0
10

So f = R(P + Q’ +S)

KIIT Deemed to be University