DLLec5c Notes
DLLec5c Notes
1 Karnaugh Maps
Maurice Karnaugh, a telecommunications engineer, developed the Karnaugh map at Bell Labs in 1953 while designing
digital logic based telephone switching circuits.
Why Karnaugh Maps ???
Why learn about Karnaugh Maps ?
• The Karnaugh Map, like Boolean algebra, is a simplification tool application applicable to digital logic.
• Boolean simplification is actually faster than the Karnaugh map for a task involving two or fewer Boolean variables.
• It is still quite usable at three variables, but a bit slower.
• At four input variables, Boolean algebra becomes tedious. Karnaugh maps are both faster and easier.
• Karnaugh maps work well for up to six input variables, are usable for up to eight variables.
E.g. 1 Out of the universe of real numbers, for example, the set of all positive integers {1,2,3,. . . } is a set. The set {3,4,5} is
an example of a smaller set, or subset of the set of all positive integers.
E.g. 2 The set of all males out of the universe of college students.
Examples :
1
2.1 Boolean Relationships on Venn Diagrams
2
2.2 3 Variable Venn Diagram
3
3 Variable Karnaugh Map Diagram From Venn Diagram
We develop a 3-variable Karnaugh map above, starting with Venn diagram like regions.
• The universe (inside the black rectangle) is split into two narrow narrow rectangular regions for A and A.
• The variables B and B divide the universe into two square regions.
• C occupies a square region in the middle of the rectangle, with C split into two vertical rectangles on each side of the
C square.
• In the final figure, we superimpose all three variables, attempting to clearly label the various regions.
Fig : 3 Variable Karnaugh Map Diagram From Venn Diagram (Final Form)
Example : 3 Variable Fig : (a) ABC selects the lower right most cell(*)
(b) ABC selects the upper left most cell (x).
4
4.1 Solving for 2 Variables
* The whole point of the organizing the K-map into a square array in which cells with any Boolean variables in common need to be
adjacent to one another so as to present a pattern.
Solving a K-Map
Fig : Solving a K-Map
* Look for adjacent cells, that is, above or to the side of a cell.
** Diagonal cells are not adjacent.
5
*** Adjacent cells will have one or more Boolean variables in common.
Fig : Example 1
Gray Code
• That means that adjacent cells will only vary by one bit, or Boolean variable.
• This is what we need to organize the outputs of a logic function so that we may view commonality.
• Moreover, the column and row headings must be in Gray code order, or the map will not work as a Karnaugh map.
• Cells sharing common Boolean variables would no longer be adjacent, nor show visual patterns.
• Adjacent cells vary by only one bit because a Gray code sequence varies by only one bit.
6
Fig : Generating a Gray Code
Fig : Example 2
• Place the 1’s in the K-map for each of the product terms
• Identify a group of two
• Write a p-term (product term) for the sole group as our simplified result.
Fig : Example 3 :(i) Equivalent Digital Logic for a Boolean Algebraic Expression (ii) Minimized Expression using K-Map
7
Fig : Equivalent Digital Circuit of Minimized Expression
Fig : Example 4
Fig : Example 5
Fig : Example 6
Fig : Example 7
Fig : Example 8
8
Cautionary Note
• Do not attempt to form groups of three.
• Groupings must be powers of 2, that is, 1, 2, 4, 8 ...
Fig : Example 1
Fig : Example 2
Fig : Example 3
Fig : Example 4
Fig : Example 5
9
Fig : Example 6
Fig : Minterm
Fig : Maxterm
10
Fig : Solution
5.1 Comparing
Fig : Comparing
• Don’t care conditions play a central role in the specification and optimization of logic circuits as they represent the
degrees of freedom of transforming a network into a functionally equivalent one.
Fig : Example
Solve the seven segment display !!
References
References
[1] Thomas L. Floyd. Digital Fundamentals, 8th edition. Pearson Education Inc., 2003.
11
[2] Z. Kohavi and N.K. Jha. Switching and Finite Automata Theory. Cambridge University Press, 2010.
[3] S. Salivahanan and S Arivazhagan. Digital Circuits and Design. Vikas Publishing House Pvt. Ltd., 2007.
12