Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map-02

Program: B.
Tech, CSE, Semester-III, Year- II

CS-304
CS-304 : Digital Systems

Unit-01
K-Map-02
Lecture – 12
July –Dec 2021
Kapil Jain
Assistant Professor
Department of Electronics & Communication Engineering
1
Outlines
I. Prerequisite
II. Objective
III. 2 Variable K-Map
IV. 3 Variable K-Map
V. Implicant, Prime Implicant
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-

• Concept of designing of combinational circuit with less number of logic circuitry.
• Minimization of boolean expression using K-Map.
• Concept of Min terms and adjacency of cell .
CS-304 4
CS-304
III. 2 Variable K-Map
x2 x1
x1 0 1 x2 0 1
m0 m1 m0 m1
0
1 2 3 2 3
m2 m3 m2 m3
5
CS-304 SELO:-03,06 Reference : 01,04
• Any two adjacent cells in the map differ by ONLY one variable, which appears
complemented in one cell and uncomplemented in the other.
Example:
• m0 (=x1’x2’) is adjacent to m1 (=x1’x2) and m2 (=x1x2’) but NOT m3 (=x1x2)
CS-304 6
CS-304
• These
f(x1,xare
2) =unweight
x1’x2’+ xbinary
1’x2 + decimal
x1x2’ codes.
= m 0 + m 1 + m2
= x1’ + x2’
• 1s placed in K-map for specified minterms m0,
m1, m2
0 1
x
• Grouping of 1s allows simplification 1 111

What (simpler) function is represented by 2 3
each dashed rectangle?
1
– x1’ = m0 + m1
– x2’ = m0 + m2
0
• Here m0 covered twice
7
IV. Three Variable K-Map
CS-304 8
Minimize the equation using k-map y=A’B’C’+A’BC’+A’BC+ABC
A'B'C' ABC = 010 = 2

= 000
ABC = 111 = 7
=0
AB'C
= 101
=5
CS-304 9
Cell Adjacency
10
CS-304 11
• Simplify the given logic diagram using K-Map method.
CS-304 12

13
V. Implicant, Prime Implicant & Essential Prime Implicant
• Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm
term in Product of Sums (POS) of a Boolean function.
F = AB + ABC + BC.
Implicants are AB, ABC and BC
• Prime Implicant
A group of square or rectangle made up of bunch of adjacent minterms which is
allowed by definition of K-Map are called prime implicants (PI) i.e. all possible
groups formed in K-Map.
14
• Essential Prime Implicants
These are those subcubes(groups) which cover atleast one minterm that can’t be
covered by any other prime implicant. Essential prime implicants(EPI) are those
prime implicants which always appear in final solution.
CS-304 15
Redundant Prime Implicants
The prime implicants for which each of its minterm is covered by some essential
prime implicant are redundant prime implicants (RPI). This prime implicant never
appears in final solution.
CS-304 16
17
VI. Learning Outcomes
• Concept of 2,3 variable boolean expression minimize by K-Map.

• Concept of implicant.
• Designing concept of combinational ciruit with minimum logics cicruit.
CS-304 18
Exercise
• A Karnaugh map (K-map) is an abstract form of ____________ diagram
organized as a matrix of squares.
a) Venn Diagram b) Cycle Diagram c) Block diagram d) Triangular Diagram
• The K-map based Boolean reduction is based on the following Unifying
Theorem: A + A’ = 1.
a) Impact b) Non Impact c) Force d) Complementarity
• Product-of-Sums expressions can be implemented using ___________
a) 2-level OR-AND logic circuits b) 2-level NOR logic circuits
c) 2-level XOR logic circuits d) Both 2-level OR-AND and NOR logic circuits
• In case of XOR/XNOR simplification we have to look for the following
a) Diagonal Adjacencies b) Offset Adjacencies
c) Straight Adjacencies d) Both diagonal and offset adjencies
CS-304 19
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 20
18
21
CS-304

Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map-02

Uploaded by

Copyright:

Available Formats

Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map-02

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map-02

Uploaded by

Copyright:

Available Formats

Program: B.

Tech, CSE, Semester-III, Year- II

CS-304 : Digital Systems

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

Objective behind to this video is to-

• Grouping of 1s allows simplification 1 111

A'B'C' ABC = 010 = 2

• Concept of 2,3 variable boolean expression minimize by K-Map.

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

You might also like