Scribd
Upload
50 views

Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map (Part-05) Topic: Don't Care Condition

This document summarizes a lecture on don't care conditions in K-maps: 1) It introduces don't care conditions, explaining that they allow larger groupings in K-maps by treating don't care cells as 0, 1, or ignoring them. 2) Examples are provided of minimizing Boolean expressions using don't care conditions in K-maps, converting between SOP and POS forms. 3) The significance of don't care conditions is that they can reduce power consumption, use fewer logic gates, and prevent hazards.

Uploaded by

Prakhar Dixit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views

Program: B.Tech, CSE, Semester-III, Year-II CS-304: Digital Systems K-Map (Part-05) Topic: Don't Care Condition

This document summarizes a lecture on don't care conditions in K-maps: 1) It introduces don't care conditions, explaining that they allow larger groupings in K-maps by treating don't care cells as 0, 1, or ignoring them. 2) Examples are provided of minimizing Boolean expressions using don't care conditions in K-maps, converting between SOP and POS forms. 3) The significance of don't care conditions is that they can reduce power consumption, use fewer logic gates, and prevent hazards.

Uploaded by

Prakhar Dixit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Program: B.

Tech, CSE, Semester-III, Year- II


CS-304

CS-304 : Digital Systems


Unit-01
K-Map ( Part-05)
Topic: Don’t Care Condition
Lecture – 17
July –Deck 2020
Kapil Jain
Assistant Professor
Department of Electronics & Communication Engineering
1
Outlines
I. Prerequisite
II. Objective
III. Don’t Care
IV. Practice Set
V. Significance of Don’t care
VI. Learning Outcomes
VII. 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.

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
• Minimize the following function in SOP minimal form using K-Maps.
F(A,B,C,D) = ∑ (1,5,6,12,13,14) + d (4)

F = BC’+BD’+A’C’D

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')

Minimise the following function in SOP minimal form using K-Maps:

F(A,B,C,D+ = m(0,1,2,3,4,5) +d (10,11,12,13,14,15)

Solution- 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 = AC'D' + A'D + A'C + AB

Minimise the following function in SOP minimal form using K-Maps: F(A, B, C,


D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(3, 5, 12)

F= AC’D’+A’D+A’C+AB

CS-304 9
CS-304 SELO:-03,06 Reference : 01,04
• Reduce the expression ∑ m (1,5,6,12,13,14) + d(2,4) and implement it inn
universal logic gate.
Solution- Expression is in POS form ∏ M (0,3,7,8,9,10,11,15) + d(2,4)

CS-304 10
CS-304 SELO:-03,06 Reference : 01,04
IV. Significance of Don't Care Conditions

• Reduced Power Consumption


• Lesser number of gates
• Prevention of Hazards
• States in Code Converters
• Simplification

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

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


don’t care condition.
• Students will be able to understand the concept of the combinational circuit
designing by don’t care condition.

CS-304 12
CS-304
VI. Exercise (Solve in Don’t Care Condition)

• One reason for using the sum-of-products form is that it can be


implemented using all ______ gates without much alteration.
A. AND B. NAND C. OR D. NOR
• The application of Boolean algebra to the solution of digital logic
circuits was first explored by ________ of ________.
A. Claude Shannon, MIT B. George Boole, MIT C. George Boole,
Stanford D. Claude Shannon, IBM
• Minimize f = m(1,5,6,12,13,14) + d(3,4,7) in SOP minimal form
• Minimize F(A,B,C,D) = m(0,1,2,3,4,5) + d(10,11,12,13,14,15) in SOP
minimal form

CS-304 13
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 14
18
15
CS-304

You might also like