Scribd
Upload
91 views

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

This document is a lecture on digital systems covering K-maps with 5 variables. It discusses: 1) The prerequisites of Boolean algebra and understanding of minterms and maxterms. 2) The objective is to minimize Boolean expressions using K-maps and the concept of don't care conditions. 3) How don't care conditions allow forming larger groups in K-maps and representing don't cares with crosses. 4) Examples are provided of simplifying Boolean functions with 5 variables into sum of products form using K-maps.

Uploaded by

Prakhar Dixit
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
91 views

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

This document is a lecture on digital systems covering K-maps with 5 variables. It discusses: 1) The prerequisites of Boolean algebra and understanding of minterms and maxterms. 2) The objective is to minimize Boolean expressions using K-maps and the concept of don't care conditions. 3) How don't care conditions allow forming larger groups in K-maps and representing don't cares with crosses. 4) Examples are provided of simplifying Boolean functions with 5 variables into sum of products form using K-maps.

Uploaded by

Prakhar Dixit
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Program: B.

Tech, CSE, Semester-III, Year- II


CS-304

CS-304 : Digital Systems


Unit-01
K-Map ( Part-04)
Lecture– 15
July –Dec 2021

Kapil Jain
Assistant Professor
Department of Electronics & Communication Engineering
1
Outlines
I. Prerequisite
II. Objective
III. Five Variable K-Map
IV. Product of Sum Form
V. Practice Set
VI. Learning Outcomes
VII. Exercise
VIII. References

111112
CS-304
I. Prerequisite of Topic

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


functioning.
• Also they have to know about the basic concept of min-term and max term.

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
using don’t care condition.
• Minimization of Boolean expression using K-Map.
• Concept of Min terms and max term , adjacency of cell .

CS-304 4
CS-304
III. Introduction
• The “Don’t Care” conditions allow us to replace the empty cell of a K-Map to
form a grouping of the variables. While forming groups of cells, we can consider
a “Don’t Care” cell as either 1 or 0 or we can simply ignore that cell.
• Therefore, “Don’t Care” condition can help us to form a larger group of cells.
• A Don’t Care cell can be represented by a cross(X) in K-Maps representing a
invalid combination. 

5
CS-304 SELO:-03,06 Reference : 01,04
• Standard SOP function into a POS expression by making the "don't care" terms
the same as they are.
• The missing minterms of the POS form are written as maxterms of the POS
form. In the same way, we can change the standard POS function into an SOP
expression by making the "don't care" terms the same as they are.
• The missing maxterms of the SOP form are written as minterm of the SOP form.

CS-304 6
CS-304 SELO:-03,06 Reference : 01,04
Five Variable K-Map

CS-304 7
CS-304 SELO:-03,06 Reference : 01,04
F(A, B, C, D) = M(6, 7, 8, 9) + d(10, 11, 12, 13, 14, 15)
F = A'(B' + C')

CS-304 8
CS-304 SELO:-03,06 Reference : 01,04
F(A, B, C, D) = M(6, 7, 8, 9) + d(10, 11, 12, 13, 14, 15)
F = A'(B' + C')

Simplify the given 5-variable Boolean equation by using k-


map.
f (A, B, C, D, E) = ∑ m (0, 5, 6, 8, 9, 10, 11, 16, 20, 42, 25, 26, 27)

CS-304 9
CS-304 SELO:-03,06 Reference : 01,04
IV. Product of Sum (POS)

C)

CS-304 10
CS-304 SELO:-03,06 Reference : 01,04
CS-304 11
CS-304 SELO:-03,06 Reference : 01,04
CS-304 12
CS-304 SELO:-03,06 Reference : 01,04
CS-304 13
CS-304 SELO:-03,06 Reference : 01,04
CS-304 14
CS-304 SELO:-03,06 Reference : 01,04
V. Learning Outcome

• Students will be able to understand the concept of minimization techniques of 05


variable function.
• Students will be able to understand the concept of Max term and be able to solve
the Boolean function in product of sum form.

CS-304 15
CS-304
VI. Exercise (Solve in POS Form)

• Solve given the given K-Map in POS.

CS-304 16
CS-304
VII. 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 17
18
18
CS-304

You might also like