Scribd
Upload
69 views13 pages

Lecture 10 - Karnaugh Maps

This document discusses Karnaugh maps, which are a pictorial representation of truth tables used to simplify Boolean functions. It covers two, three, and four variable Karnaugh maps and how to: - Read minterms from the maps - Simplify Boolean functions expressed as sums of minterms - Find implicants, prime implicants, and essential prime implicants - Handle "don't care" conditions to further simplify Boolean expressions

Uploaded by

Ahmed
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
69 views13 pages

Lecture 10 - Karnaugh Maps

This document discusses Karnaugh maps, which are a pictorial representation of truth tables used to simplify Boolean functions. It covers two, three, and four variable Karnaugh maps and how to: - Read minterms from the maps - Simplify Boolean functions expressed as sums of minterms - Find implicants, prime implicants, and essential prime implicants - Handle "don't care" conditions to further simplify Boolean expressions

Uploaded by

Ahmed
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/ 13

Lecture 10

Karnaugh Maps

1
The Map Method
• Karnaugh map simplification
- Simple straight forward procedure
• K-map is a pictorial form of truth table
- Diagram made up of squares
- Each square represents one minterm of function
• Variable map
- Two variable map
- Three variable map
- Four variable map

2
Two Variable Map
• Four minterms for two variables
- Map consists of 4 squares, one for each minterm
• We can read the minterms from the map just like we can
read them from the truth

3
Two Variable Map
• Example: Find F1 and F2. Also find the cost of the function.

Solution:
F = Cost= literal+term+complement
F =x+y

4
Three Variable Map
• Eight minterms for two variables
- Map consists of 8 squares, one for each minterm
• We can read the minterms from the map just like we can
read them from the truth

5
Three Variable Map
• Example
F(x,y,z) = ∑ m(0,2,4,6)

Solution:
m + m + m + m = x′y′z′ + x′yz′ + xy′z′ + xyz′
= x′z′(y′+y) + xz′(y′+y)
= x ′z′ + xz′
= z′(x′ + x)
= z′

6
Three Variable Map
• Example
F(x,y,z) = ∑ m(0,1,2,3,6,7)

Solution:

7
Three Variable Map
• If function is not expressed as sum of minterms form
- Use map to obtain minterms of function
- Simplify the function
• Example :
F = x′z + x′y + xy′z + yz
Solution:
F(x,y,z) = x′z + x′y + xy′z + yz
1,3 2,3 5 3,7
= ∑ m(1,2,3,5,7)
= z + x′y

8
Four Variable Map
• 16 minterms for four variables
- Map consists of 16 squares, one for each minterm
• We can read the minterms from the map just like we can
read them from the truth

9
Four Variable Map
• Example
F(w,x,y,z) = ∑ m(0,1,2,4,5,6,8,9,12,13,14)

Solution:

F = y′ + w′z′ + xz′
10
Prime Implicant’s
• While choosing adjacent squares in map
- All minterms of function are covered we combine squares
- The number of terms in expression is minimized
• Implicant
- a product term is an implicant of function if the function has
value 1 for all minterms of the product term
• Prime Implicant
- a product term obtained by combining maximum number of
adjacent squares in a map
• Essential Prime Implicant
- Should be a prime implicant and atleast there is a single one
which cannot be combined in any other way
11
Prime Implicant’s
• Example
F(w,x,y,z) = ∑(1,3,4,5,6,7,12,14)
Find implicant, prime implicants and essential implicants.

Solution:
Implicant’s: 8
Prime implicant’s:
3 (A′D, A′B, BD′)
Essential prime implicant’s:
2 (A′D, BD’)

12
Don’t Care Conditions
• Minterm that may produce either 0 or 1 for the function
• To help simple boolean expression further in K-map,
• It is denoted by ‘x’.
• Example
F(w,x,y,z) = ∑m(1,3,7,11,15), d(w,x,y,z) = ∑m(0,2,5)
Solution:
F(w,x,y,z) = w′x′+ yz
Or
F(w,x,y,z) = w′z+ yz

13

You might also like