0% found this document useful (0 votes)
39 views

Week 9

The document discusses four-variable Karnaugh maps. It provides an example of a four-variable K-map layout with the variable ordering of WXYZ. It describes how groups of 1's can be combined in the map to simplify Boolean functions down to product terms. Don't care conditions are introduced which allow further simplification by treating don't cares as optionally coverable 1's. An example problem is provided to simplify a function using a K-map that contains don't care values.

Uploaded by

lucifer 041
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views

Week 9

The document discusses four-variable Karnaugh maps. It provides an example of a four-variable K-map layout with the variable ordering of WXYZ. It describes how groups of 1's can be combined in the map to simplify Boolean functions down to product terms. Don't care conditions are introduced which allow further simplification by treating don't cares as optionally coverable 1's. An example problem is provided to simplify a function using a K-map that contains don't care values.

Uploaded by

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

Week 8 – KMaps

2
Four-Variable Map
• 4 variables Karnaugh map Cells = 24 = 16

YZ

WX
00 01 11 10
00 0 1 3 2

01 4 5 7 6

11 12 13 15 14

10 8 9 11 10

3
Four-Variable Maps
YZ
00 01 11 10
WX

00 m0 m1 m3 m2

01 m4 m5 m7 m6

11 m12 m13 m15 m14

10 m8 m9 m11 m10

• Top cells are adjacent to bottom cells. Left-edge cells are adjacent to right-edge cells.
• Note variable ordering (WXYZ).
4
5
6
Four-variable Map Simplification
• One square represents a minterm of 4 literals.
• A rectangle of 2 adjacent squares represents a
product term of 3 literals.
• A rectangle of 4 squares represents a product term of
2 literals.
• A rectangle of 8 squares represents a product term of
1 literal.
• A rectangle of 16 squares produces a function that is
equal to logic 1.

PJF - 7
8
Example
• Simplify the following Boolean function (A,B,C,D) =
∑m(0,1,2,4,5,7,8,9,10,12,13).
• First put the function g( ) into the map, and then
group as many 1s as possible.
ab cd

1 1 1 1 1 1

1 1 1 1 1 1

1 1 1 1

1 1 1 1 1 1

g(A,B,C,D) = c’+b’d’+a’bd
PJF - 9
Example

10
Example

11
Example

12
Example

13
Example

14
Example

15
Example

16
Example

17
Exercise
Given the truth table, find the simplified SOP and POS form.

A B C Y
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

18
Don't Care Conditions
• There may be a combination of input values which
• will never occur
• if they do occur, the output is of no concern.
• The function value for such combinations is called a don't
care.
• They are denoted with x or –. Each x may be arbitrarily
assigned the value 0 or 1 in an implementation.
• Don’t cares can be used to further simplify a function

PJF - 19
Minimization using Don’t Cares
• Treat don't cares as if they are 1s to generate PIs.
• Delete PI's that cover only don't care minterms.
• Treat the covering of remaining don't care minterms as optional in
the selection process (i.e. they may be, but need not be, covered).

PJF - 20
21
cd
ab 00 01 11 10
Example 00 0 1 0 1
01 1 1 0 1
• Simplify the function f(a,b,c,d) 11 0 0 x x
whose K-map is shown at the right. 10 1 1 x x
• f = a’c’d+ab’+cd’+a’bc’
0 1 0 1
or 1 1 0 1
• f = a’c’d+ab’+cd’+a’bd’ 0 0 x x
1 1 x x

0 1 0 1
1 1 0 1
0 0 x x
1 1 x x
PJF - 22

You might also like