Don't-care conditions in K-maps — Hinglish notes

3.1.12 · Hardware › Boolean Algebra & Logic Gates

DON'T-CARES EXIST KYUN KARTE HAIN?

WHY they occur — do real reasons:

Impossible inputs. Example: BCD (Binary-Coded Decimal) digit 4 bits use karta hai lekin sirf $0$ – $9$ encode karta hai. Combinations $1010$ se $1111$ tak (yani $10$ – $15$ ) kisi valid BCD source se kabhi produce nahi hote. Circuit un inputs ke liye kya output deta hai — irrelevant hai, woh inputs kabhi aate hi nahi.
Unused outputs. Kabhi kabhi kisi given input ke liye downstream logic output ko ignore kar deta hai (jaise enable line off ho), to hume parwah nahi ki woh kya hai.

K-MAP MEIN DON'T-CARES USE KAISE KAREIN — RULES

RULE 2 KYUN? Ek expression product terms ka sum hai. Har group jo tum draw karte ho ek term (extra hardware) ban jaata hai. Agar group mein koi real 1 nahi hai, to woh un input combinations ke liye output produce karta hai jo tumne kabhi chahaa hi nahi — tumne ek gate ke liye paisa diya jo kuch useful nahi karta.

Figure — Don't-care conditions in K-maps

Worked Example 1 — BCD "kya digit ≥ 5 hai?"

Inputs $A B C D$ = ek BCD digit (0–9). Output $F = 1$ jab digit $\geq 5$ . Digits $10$ – $15$ kabhi occur nahi karte → don't-cares.

Minterms jahan $F = 1$ : $5, 6, 7, 8, 9$ . Don't-cares: $10, 11, 12, 13, 14, 15$ .

K-map (rows $A B$ , cols $C D$ Gray order mein $00, 01, 11, 10$ ):

AB\CD	00	01	11	10
00	0	0	0	0
01	0	1(5)	1(7)	1(6)
11	X	X	X	X
10	1(8)	1(9)	X	X

Step 1 — 8,9 ko poore bottom-left don't-care region ke saath group karo. Yeh step kyun? Cells $8, 9, 12, 13$ ek 4-cell block banate hain ( $A B = 1 -$ , chalo real coords use karte hain). Pure bottom do rows column region lo taaki $A = 1$ wala hissa $12, 13, 14, 15$ ko $X$ ke roop mein absorb kare. Group ${8, 9, 10, 11, 12, 13, 14, 15}$ = sabhi cells jahan $A = 1$ → sirf $A$ mein simplify hota hai. Kyun allowed hai? Kyunki $10$ – $15$ $X$ hain; humne unhe legally = 1 choose kiya.

Step 2 — 5,6,7 ko 13,14,15 don't-cares ke saath group karo. Kyun? ${5, 7, 13, 15}$ mein $B = 1, D = 1$ common hai? Iske bajaye ${6, 7, 14, 15}$ ( $B = 1, C = 1$ ) aur ${5, 7, 13, 15}$ ( $B = 1, D = 1$ ) lo. $13, 14, 15$ par $X$ 's use karne se yeh size-4 groups ban jaate hain jo $B C$ aur $B D$ dete hain.

Result: $F = A + B C + B D$

Compare karo: Don't-cares ke bina tumhe $F = A \overset{ˉ}{B} + B C + B D + A \overset{ˉ}{C} \overset{ˉ}{D}$ -style complexity chahiye hoti. Don't-cares ne ise clean $A + B C + B D$ mein collapse kar diya.

Worked Example 2 — chhota 3-variable map

$F (A, B, C) = \sum m (1, 3, 7) + \sum d (5)$ .

A\BC	00	01	11	10
0	0	1(1)	1(3)	0
1	0	X(5)	1(7)	0

Step 1 — Column $B C = 01$ aur $B C = 11$ group karein? Nahi — chaar cells ${1, 3, 5, 7}$ group karo. Kyun? ${1, 3, 7}$ 1s hain; $5$ $X$ hai. Cells $1, 3, 5, 7$ exactly woh sabhi cells hain jahan $C = 1$ → size-4 group → $C$ mein simplify hota hai. $X$ kyun use karein? Bina $5$ ko 1 treat kiye, 1s ka sabse bada group ${1, 3}$ hota ( $\overset{ˉ}{A} C$ deta) aur alag ${3, 7}$ ( $B C$ ) hota. $X$ use karne se teen terms ek single literal ban jaate hain.

Result: $F = C$ . (Sirf ek wire!)

Common mistakes (Steel-man + fix)

Flashcards

Don't-care condition kya hoti hai?

Ek input combination jiska output unspecified ho — ya to woh kabhi occur nahi kar sakta ya uski value ignore ki jaati hai; K-map mein

X

se mark karte hain.

BCD circuits mein don't-cares kyun arise hote hain?

BCD 4 bits use karta hai lekin sirf 0–9 encode karta hai; combinations 10–15 kabhi occur nahi karte, isliye unke outputs don't-cares hain.

K-map group mein X use karne ka golden rule kya hai?

Use include karo sirf tab jab woh ek aisi group ko enlarge kare jo already kam se kam ek real 1 cover karti ho.

Sirf X's group kyun nahi karne chahiye?

Group ek extra product term (extra hardware) ban jaata hai jo un inputs ko cover karta hai jinhe tum care nahi karte — bilkul waste hai.

K-map/truth table mein don't-care ka symbol kya hai?

X

(kabhi kabhi

d

ϕ

Example 2 mein,

F = \sum m (1, 3, 7) + \sum d (5)

, minimised

F

kya hai?

F = C

(5 par X use karke sabhi C=1 cells ka size-4 group complete kiya).

Kya don't-cares ko kabhi cover karna zaroori hai?

Nahi — X ko cover karna optional hai; sirf 1s ko cover karna zaroori hai.

Recall Feynman: ek 12-saal ke bacche ko explain karo

Socho tum lunchboxes pack kar rahe ho lekin tum JAANTE ho ki aaj teen bachche absent hain — woh kabhi apne boxes nahi kholenge. To un teen boxes mein kya daala yeh matter hi nahi karta! Tum pretend kar sakte ho ki unmein "sandwiches" hain agar isse tumhe saaf aur identical rows mein pack karne mein madad mile (packing aasaan ho jaaye), ya unhe ignore kar do agar woh zyada easy ho. Absent bacchon ke boxes = don't-cares. K-map mein, $X$ ek aisa box hai jise tum full ( $1$ ) ya empty ( $0$ ) call kar sakte ho — jo bhi tumhara final pattern sabse simple banaye.

Connections

Karnaugh Maps (K-maps) — base technique jo don't-cares extend karti hai.
Sum of Products (SOP) and Product of Sums (POS) — har group = ek term.
BCD - Binary Coded Decimal — don't-cares ka classic source (10–15).
Quine-McCluskey Method — don't-cares ko algorithmically kaise handle karte hain.
Boolean Simplification — goal: kam se kam literals/terms.
Logic Gates & Hardware Cost — isliye kam terms = sasta circuit.