DON’T CARE

CONDITIONS

B.M.K.Reddy
 DON’T CARE CONDITIONS
» Till now for each combination of input variable we have
specified a minterm/maxterm by representing them as
1/0 in the K-Map.

» But, here is special case such as

» when for a given input combination we may not have a
specified output or
» the input combination may be invalid.
 DON’T CARE CONDITIONS
» The combinations for which we don't have any output
expression are called don't care combination.
combination

» For Example, in 8421 code,

» input states 1001, 1010, 1011, 1100, 1101, 1110 and 1111
are invalid and
» the corresponding output is the don't care.

» Similarly, in Excess-3 code,

» binary input states 0000, 0001, 0010, 1101, 1110 and 1111
are unspecified and are also represented by don't care.
 DON’T CARE CONDITIONS
» These don't care combinations in
combinations the K-Map are denoted
by an X (cross) symbol.

» The X is called "Don't care conditions“

conditions

» The value for Don’t cares in a Karnaugh map, or truth

table, may be either 1s or 0s

» We plot these cells with X, among the normal 1s and 0s.

 DON’T CARE CONDITIONS
» Examples
» Minimise the following function in SOP minimal form
using K-Maps:
F = ∑m(1, 5, 6, 12, 13, 14) + d(4)
CD C’D’ C’D CD CD’
AB 00 01 11 10
A’B 00 0
1 1 3 2
’
A’B 01 X 1 1
4 5 7 6

A 11 1 12 1 1
13 15 14
B
AB 10
8 9 11 10
’
 DON’T CARE CONDITIONS
» Examples F = ∑m(1, 5, 6, 12, 13, 14) + d(4)

CD C’D’ C’D CD CD’

AB 00 01 11 10 A’C’D

A’B 00 0
1 1 3 2
’
A’B 01 1 1 1
4 5 7 6

A 11 1 12 1 1
13 15 14
B
AB 10
8 9 11 10
’
BC’
BD’
 DON’T CARE CONDITIONS
» Examples
CD C’D’ C’D CD CD’
AB 00 01 11 10 A’C’D

A’B 00 0
1 1 3 2
’
A’B 01 X 1 1
4 5 7 6

A 11 1 12 1 1
13 15 14
B
AB 10
8 9 11 10
’
BC’
BD’
F = ∑m(1, 5, 6, 12, 13, 14) + d(4) = BC' + BD' + A'C'D
 DON’T CARE CONDITIONS
» Examples
» Minimise the following function in SOP minimal form
using K-Maps:
F = F(A, B, C, D) = m(0, 1, 3, 4, 5) + d(10, 11, 12, 13, 14, 15)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1 1 1
00
A’B 0 1 3 2

’
A’B 01 1 4
1 5 7 6

A B 11 X X X X
12 13 15 14

AB’ 10 X X 10
8 9 11
 DON’T CARE CONDITIONS
» Examples
F = F(A, B, C, D) = m(0, 1, 2, 3, 4, 5) + d(10, 11, 12, 13, 14, 15)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1 1 1
A’B 00
0 1 3 2 B’C
’
A’B 01 1 4
1 5 7 6

A’C A B 11 X X X X
’ 12 13 15 14

AB’ 10 1 1 10
8 9 11

F = F(A, B, C, D) = A’C’ + B’C

 DON’T CARE CONDITIONS
» Examples
F = F(A, B, C, D) = m(0, 1, 2, 3, 4, 5) + d(10, 11, 12, 13, 14, 15)
» Writing the given expression in POS form:
F = F(A, B, C, D) = M(6, 7, 8, 9) + d(10, 11, 12, 13, 14, 15)

CD C’D’ C’D CD CD’

AB 00 01 11 10

00
A’B 0 1 3 2

’
A’B 01 4 5
0 7
0 6

A B 11 X X X X
12 13 15 14

AB’ 10 0 0 X X 10
8 9 11
 DON’T CARE CONDITIONS
» Examples
» Writing the given expression in POS form:
F = F(A, B, C, D) = M(6, 7, 8, 9) + d(10, 11, 12, 13, 14, 15)

CD C’D’ C’D CD CD’

AB 00 01 11 10

00
A’B 0 1 3 2

’
A’B 01 4 5
0 7
0 6

B’ + C’
A B 11 0 0 0 0
12 13 15 14

AB’ 10 0 0 0 0 10
A’ 8 9 11

F = F(A, B, C, D) = A’(B’ + C’)

 DON’T CARE CONDITIONS
» Examples
» 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)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 X 1
00
A’B 0 1 3 2

’
A’B 01 4
X 5
1 7
1 6

A B 11 X 1 1 1
12 13 15 14

AB’ 10 1 8 9 11 10
 DON’T CARE CONDITIONS
» Examples
F(A, B, C, D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(3, 5, 12)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 X 1
00
A’B 0 1 3 2

’
A’B 01 4
X 5
1 7
1 6

A B 11 X 1 1 1
12 13 15 14

AB’ 10 1 8 9 11 10
 DON’T CARE CONDITIONS
» Examples
» 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)

CD C’D’ C’D CD CD’

AB 00 01 11 10
A’D
1 X 1
00
A’B 0 1 3 2

’
X 1 1 A’C
A’B 01 4 5 7 6

A B 11 X 1 1 1
AB
12 13 15 14
AC’D’ AB’ 10 1 8 9 11 10

F(A, B, C, D) = A’C + A’D + AB + AC’D’

 DON’T CARE CONDITIONS
» Examples
» Minimize the given Boolean Expression by using the
four-variable K-Map.
F (A, B, C, D) = Σ m (1, 5, 6, 12, 13, 14) + d (2, 4).

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 X
00
A’B 0 1 3 2

’
A’B 01 X 4
1 5 7
1 6

A B 11 1 1 1
12 13 15 14

AB’ 10
8 9 11 10
 DON’T CARE CONDITIONS
» Examples
» Minimize the given Boolean Expression by using the
four-variable K-Map.
F (A, B, C, D) = Σ m (1, 5, 6, 12, 13, 14) + d (2, 4).

CD C’D’ C’D CD CD’ A’C’D

AB 00 01 11 10
1 X
00
A’B 0 1 3 2

’ BD’
A’B 01 X 4
1 5 7
1 6

A B 11 1 1 1
12 13 15 14

AB’ 10
BC’ 8 9 11 10
 DON’T CARE CONDITIONS
» Examples
F (A, B, C, D) = Σ m (1, 5, 6, 12, 13, 14) + d (2, 4).

CD C’D’ C’D CD CD’ A’C’D

AB 00 01 11 10
1 X
00
A’B 0 1 3 2

’ BD’
A’B 01 X 4
1 5 7
1 6

A B 11 1 1 1
12 13 15 14

AB’ 10
BC’ 8 9 11 10

F (A, B, C, D) = B.C’ + B.D’ + A’.C’.D

 DON’T CARE CONDITIONS
» Examples
» Minimize the given Boolean Expression by using the
four-variable K-Map.
F (A, B, C, D) = Σ m (0, 2, 3, 5, 6, 8, 9) + d (10, 11, 12, 13, 14,15)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1 1
00
A’B 0 1 3 2

’
A’B 01 4
1 5 7
1 6

A B 11 X X X X 14
12 13 15

AB’ 10 1 1 X X 10
8 9 11
 DON’T CARE CONDITIONS
» Examples
» Minimize the given Boolean Expression by using the
four-variable K-Map.
F (A, B, C, D) = Σ m (0, 2, 3, 5, 6, 8, 9) + d (10, 11, 12, 13, 14,15)

CD C’D’ C’D CD CD’

B’CD AB 00 01 11 10
1 1 1
00
A’B 0 1 3 2

’
BC’D 1 1
A’B 01 4 5 7 6
CD’
A B 11 X X X X 14
12 13 15

AB’ 10 1 1 X X 10 B’D’
A 8 9 11
 DON’T CARE CONDITIONS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 6, 8, 9) + d (10, 11, 12, 13, 14,15)

CD C’D’ C’D CD CD’

B’CD AB 00 01 11 10
1 1 1
00
A’B 0 1 3 2

’
BC’D 1 1
A’B 01 4 5 7 6
CD’
A B 11 X X X X 14
12 13 15

AB’ 10 1 1 X X 10 B’D’
A 8 9 11

F (A, B, C, D) = A + C. D’ + B’. D’ + B’. C. D + B. C’. D

 DON’T CARE CONDITIONS
» Examples
» Minimize the given Boolean Expression by using K-
Map with and without don’t cares.
F (A, B, C, D) = πM (1, 3, 5, 7, 9) + d (6, 12, 13)

CD C’D’ C’D CD CD’

AB 00 01 11 10
0 0
00
A’B 0 1 3 2

’
A’B 01 4
0 5
0 7
X 6

A B 11 X X
12 13 15 14

AB’ 10 0
8 9 11 10
 DON’T CARE CONDITIONS
» Examples
» Without don’t cares.
F (A, B, C, D) = πM (1, 3, 5, 7, 9) + d (6, 12, 13)

CD C’D’ C’D CD CD’

AB 00 01 11 10
0 0
00 A + D’
A’B 0 1 3 2

’
A’B 01 4
0 5
0 7
X 6

B + C + D’
A B 11 X X
12 13 15 14

AB’ 10 0
8 9 11 10

F (A, B, C, D) = (A + D’)(B + C + D’)

 DON’T CARE CONDITIONS
» Examples
» With don’t cares.
F (A, B, C, D) = πM (1, 3, 5, 7, 9) + d (6, 12, 13)

CD C’D’ C’D CD CD’

AB 00 01 11 10
0 0
00 A + D’
A’B 0 1 3 2

’
A’B 01 4
0 5
0 7
X 6

C + D’
A B 11 X X
12 13 15 14

AB’ 10 0
8 9 11 10

F (A, B, C, D) = (A + D’)(C + D’)

 DON’T CARE CONDITIONS
» Significance of “Don’t Care” Conditions:
Don’t Care conditions has the following significance
with respect to the digital circuit design
» Simplification:
» These conditions denotes the set of inputs which never
occurs for a given digital circuits. Thus, they are being used
to further simplify the Boolean output expression.
» Lesser number of gates:
» Simplification reduces the number of gates to be used for
implementing the given expression. Therefore, don’t cares
make the digital circuit design more economical.
 DON’T CARE CONDITIONS
» Significance of “Don’t Care” Conditions:
Don’t Care conditions has the following significance
with respect to the digital circuit design
» Reduced Power Consumption:
» While grouping the terms long with don’t cares reduces
switching of the states. This decreases the required memory
space which in turn results in less power consumption.
» States in Code Converters:
» These are used in code converters. For example- In design of
4-bit BCD-to-XS-3 code converter, the input combinations
1010, 1011, 1100, 1101, 1110, and 1111 are don’t cares.
 DON’T CARE CONDITIONS
» Significance of “Don’t Care” Conditions:
Don’t Care conditions has the following significance
with respect to the digital circuit design
» Prevention of Hazards:
» Don’t cares also prevents hazards in digital systems.
 PRIME IMPLICANTS
» Prime Implicants
» Each square or rectangle or group made up of the bunch
of adjacent minterms is called ‘Subcube’.

» Each of these subcubes is called “Prime Implicant (PI)”.

» The Prime implicant which contains at least one 1 which

can not be covered by any other Prime implicant is
called “Essential Prime Implicant (EPI)”.
 PRIME IMPLICANTS
» The Prime implicant whose each 1 is covered by at least
one EPI is called a “Redundant Prime Implicant (RPI)”.

» The Prime implicant which is neither an EPI nor a RPI

is called a “Selective Prime Implicant (SPI)”.
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (3, 4, 5 , 7, 9, 13, 14, 15)

CD C’D’ C’D CD CD’

AB 00 01 11 10 EPI
EPI 1
00
A’B 0 1 3 2

’
A’B 01 1 1 1
RPI 4 5 7 6
EPI
A B 11 1 13 1 1
12 15 14

AB’ 10
8 1 9 11 10

EPI
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (3, 4, 5 , 7, 9, 13, 14, 15)
CD C’D’ C’D CD CD’
AB 00 01 11 10 A’CD
A’BC’ 1
00
A’B 0 1 3 2

’
A’B 01 1 1 1
BD 4 5 7 6
ABC
A B 11 1 13 1 1
12 15 14

AB’ 10
8 1 9 11 10

AC’D

PI = {BD, A’CD, A’BC’, ABC, AC’D} = 5

EPI = {A’CD, A’BC’, ABC, AC’D} = 4
RPI = {BD} = 1
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 4, 5, 10, 11, 13, 15)
EPI
SPI

CD C’D’ C’D CD CD’

AB 00 01 11 10
1
00
A’B 0 1 3 2

’
1 1 SPI
A’B 01 4 5 7 6

SPI
A B 11 1 13 1
SPI 12 15 14

AB’ 10 EPI
8 9 1 11 1 10

EPI = { A’C’D’, AB’C } = 2

 PRIME IMPLICANTS
» Examples
F (A, B, C) = Σ m (0, 2, 3, 4, 5, 7)

BC B’C’ B’C BC BC’ A’B

A 00 01 11 10

A’ 0 1 1 1
B’C’ 0 1 3 2

AC
A 1 1 1 1
4 5 7 6

F = A’B + AC + B’C’
 PRIME IMPLICANTS
» Examples
F (A, B, C) = Σ m (0, 2, 3, 4, 5, 7)
BC

BC B’C’ B’C BC BC’ AC

A 00 01 11 10
A’C’
A’ 0 1 1 1
B’C’ 0 1 3 2

AC
AB’ A 1 1 1 1
4 5 7 6

PI = { A’B , AC , B’C’ , BC , AB’ , A’C’ } = 6

 PRIME IMPLICANTS
» Examples
F (A, B, C) = Σ m (0, 2, 3, 4, 5, 7)

BC B’C’ B’C BC BC’

A 00 01 11 10

A’ 0 1 1 1
0 1 3 2

A 1 1 1 1
4 5 7 6

EPI = { } = 0
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)

CD

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1 3 1
A’B 00
0 1 2 AC
B’D’ ’
A’B 01 4
1 5
1 7 6

A B 11 1 1
A’BD 12 13 15 14

AB’ 10
1 8 9 1 11 1 10

F (A, B, C, D) = AC + CD + B’D’ + A’BD

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)

CD
B’C
CD C’D’ C’D CD CD’
AB 00 01 11 10
1 1 3 1
A’B 00
0 1 2 AC
B’D’ ’
A’B 01 4
1 5
1 7 6

A B 11 1 1
A’BD 12 13 15 14

AB’ 10
1 8 9 1 11 1 10

PI = { AC, CD, B’D’, B’C, A’BD } = 5

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)

CD
B’C
CD C’D’ C’D CD CD’
AB 00 01 11 10
1 1 3 1
A’B 00
0 1 2 AC
B’D’ ’
A’B 01 4
1 5
1 7 6

A B 11 1 1
A’BD 12 13 15 14

AB’ 10
1 8 9 1 11 1 10

EPI = { AC, B’D’, A’BD } = 3

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 4, 5, 10, 11, 13, 15)
A’CD’

CD C’D’ C’D CD CD’

AB 00 01 11 10
1
00
A’B 0 1 3 2

’
A’B 01 4 5
1 7
1 6

A B 11 1 13 1 BCD
AC’D 12 15 14

AB’ 10
8 1 9 11 10

F (A,B,C,D) = A’CD’ + BCD + AC’D

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 4, 5, 10, 11, 13, 15)
PI (A’CD’)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1
00
A’B 0 1 3 2

’
1 1 PI (A’BC)
A’B 01 4 5 7 6

PI (BCD)
A B 11 1 13 1 PI (ABD)
12 15 14

AB’ 10
8 1 9 11 10

PI (AC’D)
PI = { A’CD’, A’BC, BCD, ABD, AC’D } = 5
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 4, 5, 10, 11, 13, 15)
EPI

CD C’D’ C’D CD CD’

AB 00 01 11 10
1
00
A’B 0 1 3 2

’
A’B 01 4 5
1 7
1 6

A B 11 1 13 1
12 15 14

AB’ 10
8 1 9 11 10

EPI EPI = { A’CD’, AC’D } = 2

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 12, 13)

A’B’C
B’C’D’ CD C’D’ C’D CD CD’
AB 00 01 11 10
1 1 3 1 2
00
A’B 0 1

’
A’B 01 4
1 5
1 7 6 A’BD
A B 11 1 1 13
12 15 14

AB’ 10 ABC’
1 8 9 11 10

F = A’B’C + A’BD + ABC’ + B’C’D’

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 12, 13)
A’B’D’
A’B’C
B’C’D’ CD C’D’ C’D CD CD’
AB 00 01 11 10
1 1 3 1 2
BC’D 00 A’CD
A’B 0 1

’
A’B 01 4
1 5
1 7 6 A’BD
A B 11 1 1 13
12 15 14

AC’D’ AB’ 10 ABC’

1 8 9 11 10

PI = { A’B’C, A’BD, ABC’, B’C’D’, A’CD, BC’D, ACD’, A’B’D’ } = 8

 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 12, 13)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1 3 1 2
00
A’B 0 1

’
A’B 01 4
1 5
1 7 6

A B 11 1 1 13
12 15 14

AB’ 10
1 8 9 11 10

EPI = { } = 0
 PRIME IMPLICANTS
» Examples
F (A, B, C, D) = Σ m (1, 5, 7, 8, 10, 12, 13, 15)
EPI (A’C’D)
EPI (BD)

CD C’D’ C’D CD CD’

AB 00 01 11 10
1 1
00
A’B 0 3 2

’
A’B 01 4
1 5
1 7 6

EPI (ABC’) A B 11 1 13 1
1 12 15 14
EPI (AB’D’)
AB’ 10
1 8 9 11 1 10

EPI = { BD, A’C’D, ABC’, AB’D’ } = 4