Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems Unit-01 Introduction of K-Map (Part-01)
Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems Unit-01 Introduction of K-Map (Part-01)
Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems Unit-01 Introduction of K-Map (Part-01)
Kapil Jain
Assistant Professor
Department of Electronics & Communication Engineering
1
Outlines
I. Prerequisite
II. Objective
III. Why K-Map?
IV. Representation of Boolean Function
V. Properties of K-Map
VI. Learning Outcome
VII. Exercise
VIII. References
111112
CS-304
I. Prerequisite of Topic
CS-304 3
CS-304
II. Objective
CS-304 4
CS-304
III. Why K-Map ?
5
CS-304 SELO:-03,06 Reference : 01,04
• Also known as Veitch diagram or K-Map.
• Invented in 1953 by Maurice Karnaugh.
• Graphical way of minimizing Boolean expressions.
• It consists tables of rows and columns with entries represent 1`s or 0`s.
CS-304 6
CS-304 SELO:-03,06 Reference : 01,04
Advantages of Karnaugh Maps
These are unweight binary decimal codes.
7
CS-304 SELO:-03,06 Reference : 01,04
IV. Representation of Boolean Expression
CS-304 8
CS-304 SELO:-03,06 Reference : 01,04
Minterm
• Product (AND function)
• Contains all variables
• Evaluates to ‘1’ for a specific combination
CS-304 9
CS-304 SELO:-03,06 Reference : 01,04
• Maxterm
• – Sum (OR function)
• – Contains all variables
• – Evaluates to ‘0’ for a specific combination
10
CS-304 SELO:-03,06 Reference : 01,04
Truth Table For Boolean Function (Using Min-Terms)
CS-304 11
CS-304 SELO:-03,06 Reference : 01,04
Using Max-Terms
12
CS-304 SELO:-03,06 Reference : 01,04
V. Properties of K-Map
• An n-variable K-map has 2n cells with n-variable truth table value.
• Adjacent cells differ in only one bit .
• Each cell refers to a minterm or maxterm.
• For minterm mi , maxterm Mi and don’t care of f we place 1 , 0 , x .
13
CS-304 SELO:-03,06 Reference : 01,04
CS-304 14
CS-304 SELO:-03,06 Reference : 01,04
Simplification Process
• No diagonals.
• Only 2^n cells in each group.
• Groups should be as large as possible.
• A group can be combined if all cells of the group have
• same set of variable.
• Overlapping allowed.
• Fewest number of groups possible
CS-304 15
CS-304 SELO:-03,06 Reference : 01,04
• Groups may not include any cell containing a zero.
CS-304 16
CS-304 SELO:-03,06 Reference : 01,04
Simplification Process
• Groups must contain 1, 2, 4, 8, or in general 2n cells. That is if n = 1, a group will
contain two 1's since 21 = 2. If n = 2, a group will contain four 1's since 22= 4.
CS-304 17
CS-304 SELO:-03,06 Reference : 01,04
Each group should be as large as possible.
CS-304 18
CS-304 SELO:-03,06
SELO : 6,8 Reference
Ref. - 06 : 01,04
Groups may overlap.
19
CS-304 SELO:-03,06 Reference : 01,04
Groups may wrap around the table.
The leftmost cell in a row may be grouped with the rightmost cell and the top
cell in a column may be grouped with the bottom cell..
CS-304 20
CS-304 SELO:-03,06 Reference : 01,04
There should be as few groups as possible, as long as.
this does not contradict any of the previous rules.
CS-304 21
CS-304 SELO:-03,06 Reference : 01,04
VI. Learning Outcome
After studying this section, you should be able to:
• Understand the use of Karnaugh maps.
• Draw maps for Multi input circuits.
• Concept of simplification of function.
• Understand the concept of minimization of expression.
• Understand the concept of designing of combinational circuit with less logic
circuitry.
CS-304 22
CS-304
VII. Exercise
• Which statement below best describes a Karnaugh map?
A. It is simply a rearranged truth table.B. The Karnaugh map eliminates the
need for using NAND and NOR gate C. Variable complements can be
eliminated by using Karnaugh maps. D. A Karnaugh map can be used to
replace Boolean rules.
• Which of the following combinations cannot be combined into K-map groups?
A. corners in the same row B. corners in the same column C. diagonal D.
overlapping combinations
• When grouping cells within a K-map, the cells must be combined in groups of
________.
A .2s B. 1, 2, 4, 8, etc .C. 4s D.3s
• The truth table for the SOP expression has how many input combinations?
A. 1 B. 2 C. 4 D. 8
CS-304 23
CS-304
IX. References
CS-304
CS-304 24
18
25
CS-304