Scribd
Upload
122 views

Karnaugh Map - Don't Care Conditions - Tabulation Method: Simplification Techniques

The document provides an introduction to Karnaugh maps, which are a graphical technique for simplifying Boolean functions. It discusses the basics of Karnaugh maps, including how they are constructed for 2, 3, and 4 variables and the rules for grouping 1s on the map. It also covers how to determine the minimum sum-of-products expression from the groupings on the Karnaugh map. The document introduces don't care conditions and how they can be used to advantage on Karnaugh maps. Finally, it discusses how to map a standard product-of-sums expression to a Karnaugh map and simplify it.

Uploaded by

Mithun Gouda
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
122 views

Karnaugh Map - Don't Care Conditions - Tabulation Method: Simplification Techniques

The document provides an introduction to Karnaugh maps, which are a graphical technique for simplifying Boolean functions. It discusses the basics of Karnaugh maps, including how they are constructed for 2, 3, and 4 variables and the rules for grouping 1s on the map. It also covers how to determine the minimum sum-of-products expression from the groupings on the Karnaugh map. The document introduces don't care conditions and how they can be used to advantage on Karnaugh maps. Finally, it discusses how to map a standard product-of-sums expression to a Karnaugh map and simplify it.

Uploaded by

Mithun Gouda
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 31

Module 1:

SIMPLIFICATION TECHNIQUES
Karnaugh map – Don’t care conditions –
Tabulation Method
Introduction to Karnaugh map
 Boolean Function:
 Truth table representation unique
 Algebraic expression appear in different form, but equivalent
 Procedure of minimization is awkward because it lacks specific rules to
predict each succeeding step in the manipulative process
 K Map or Karnaugh Map
 Also known as Veitch diagram or K-map, invented in 1953 by
Maurice Karnaugh
 Simple straight forward procedure for minimizing Boolean
functions (a graphical approach)
 It consists of tables of rows and columns with entries represent
1’s or 0.s
Advantages of Karnaugh map
 Data representation’s simplicity
 Changes in neighbouring variables are easily displayed
 Changes easy and convenient to implement
 Reduce the cost and quantity of logical gates
K Map
 K map is a diagram made up of squares
 Each square representing a minterm of the function to be
minimized.
 Simplified expression obtained by k-map can be
represented in any one form
 SOP (Sum of Products)
 POS (Products of Sum)
 K-maps can be used for expressions with 2, 3, 4, and 5
variables.
 Two Variable k map, Three Variable k map
 Four Variable K map, Five Variable K map
Rules of K Map

 Groups may not include any cell containing a zero


 Groups may be horizontal or vertical but not diagonal
 Groups must contain 1,2,4,8 or in general 2n cells.
 Each group should be large as possible
 Each cell containing a one must be at least one group
 Group must overlap
 Groups may wrap the table
 There should be few groups as possible as long as this
should not contradict over previous rules
Two variable K-map
 There are four minterms for two variables.
 The map consists of four squares, one for
each minterm
B
0 1
B A
0 1 1
A 0 X’Y’ 0 X’Y
0 m0 m1 2 3
1 XY’ XY
1 m2 m3
Each square represents
one minterm
Two variable k map example

x
Three variable K map
 Eight min terms for three variables
 There are 8 cells as shown:

BC
00 01 11 10
A
0 ABC ABC A BC A BC

1 AB C AB C ABC ABC
4 variable K-map
4 variable k map
Grouping the 1s (example)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 00 1 1

01 1 1 1 1 01 1 1 1

11 11 1 1 1

10 1 1 10 1 1 1
Determining the Minimum SOP Expression
from the Map (example)

CD
00 01 11 10 B  A C  AC D
AB
00 1 1 AC
01 1 1 1 1 B
11 1 1 1 1
AC D
10 1
Determining the Minimum SOP Expression
from the Map (exercises)
CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 00 1 1

01 1 1 1 1 01 1 1 1

11 11 1 1 1

10 1 1 10 1 1 1

A B  A C  AB D D  AB C  BC
Mapping Directly from a Truth Table

I/P O/P
A B C X C
0 1
0 0 0 1 AB
0 0 1 0
00 1
0 1 0 0
0 1 1 0 01
1 0 0 1
11 1
1 0 1 0 1
1 1 0 1
10 1
1 1 1 1
“Don’t Care” Conditions
 Sometimes a situation arises in which some input
variable combinations are not allowed, i.e. BCD code:
 There are six invalid combinations: 1010, 1011, 1100,
1101, 1110, and 1111.
 Since these unallowed states will never occur in an
application involving the BCD code  they can be
treated as “don’t care” terms with respect to their effect
on the output.
 The “don’t care” terms can be used to advantage on the
K-map (how? see the next slide).
“Don’t Care” Conditions
INPUTS O/P CD
A B C D Y 00 01 11 10
0 0 0 0 0 AB
0 0 0 1 0
0 0 1 0 0 00
01 1
0 0 1 1 0
0 1 0 0 0
0
0
1
1
0
1
1
0
0
0
11 x x x x
0
1
1
0
1
0
1
0
1
1
10 1 1 x x
1 0 0 1 1
1 0 1 0 X
Without “don’t care”
Y  AB C  A BCD
1 0 1 1 X
1 1 0 0 X
1 1 0 1 X With “don’t care”
Y  A  BCD
1 1 1 0 X
1 1 1 1 X
K-map with don’t care conditions
K-Map POS Minimization

 The approaches are much the same (as SOP)


except that with POS expression, 0s
representing the standard sum terms are placed
on the K-map instead of 1s.
Mapping a Standard POS Expression (full
example)
The expression:
C
( A  B  C )( A  B  C )( A  B  C )( A  B  C ) 0 1
AB
000 010 110 101
00
0
01
0
11 0
10
0
K-map Simplification of POS Expression

( A  B  C )( A  B  C )( A  B  C )( A  B  C )( A  B  C )

C
0 1 POS
AB A

00 0 0 A( B  C )

01 AB  AC
0 0
11 AC
B C
0 1 SOP
10 1 1 AB
References

 M. Morris Mano – Digital Logic and Computer


Design PHI – 5th Edition- 2004.

You might also like