Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems Unit-01 Introduction of K-Map (Part-01)

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 25

Program: B.

Tech, CSE, Semester-III, Year- II


CS-304

CS-304 : Digital Systems


Unit-01
Introduction of K-Map ( Part-01)
Lecture – 12
July –Dec 2021

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

• Students should have a good understanding of Boolean algebra and their


functioning and also know about the basic concept of logic gates and their truth
table.

CS-304 3
CS-304
II. Objective

Objective behind to this video is to understand the concept of designing of


combinational circuit with less number of logic circuitry and understand the
concept of Boolean algebra in digital circuit.

CS-304 4
CS-304
III. Why K-Map ?

• Karnaugh Maps offer a graphical method of reducing a digital circuit to its


minimum number of gates. The map is a simple table containing 1s and 0s that
can express a truth table or complex Boolean expression describing the operation
of a digital circuit.
• The map is then used to work out the minimum number of gates needed, by
graphical means rather than by algebra. Karnaugh maps can be used on small
circuits having two or three inputs as an alternative to Boolean algebra, and on
more complex circuits having up to 6 inputs.
• it can provide quicker and simpler minimization than Boolean algebra.

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.

• Data representation’s simplicity.


• Changes in neighboring variables are easily displayed
• Changes Easy and Convenient to implement.
• Reduces the cost and quantity of logical gates.

7
CS-304 SELO:-03,06 Reference : 01,04
IV. Representation of Boolean Expression

• The SOP (Sum of Product) expression represents 1’s .


(A.B)+(B.C).
• The POS (Product of Sum) expression represents the low (0) values in the K-
Map.
(A+B).(C+D)

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.

• Groups may be horizontal or vertical, but not diagonal.

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.

Each cell containing a one must be in at least one group.

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

1) Anand Kumar “ Fundamental of Digital Circuits” PHI Publication.


2) A.K Godse “ Digital Electronics”.
3) R. K. Gaur “ Digital Electronics & Microcomputers” Dhanpat Rai Publication.
4) Morris Mano “ Digital Circuit Design "Pearson Publication.
5) https://www.electronics-tutorials.ws/
6) https://www.geeksforgeeks.org/
7) https://www.gatevidyalay.com
8) https://www.tutorialspoint.com/
9) https://www.electrical4u.com/
10) https://www.electronicshub.org/

CS-304
CS-304 24
18
25
CS-304

You might also like