Scribd
Upload
83 views12 pages

Week 6 - Module 5 Karnaugh Maps

This document discusses Karnaugh maps, which are a graphical method for simplifying Boolean functions. Karnaugh maps arrange variables in a table to represent minterms. Minterms with a value of 1 are marked on the map. Adjacent 1 squares can be combined in groups of 2, 4, 8, etc. to find prime implicants and minimize the function. The document provides examples of 2, 3, and 4 variable Karnaugh maps and describes how to handle don't care conditions. It also prompts practicing simplifying a specific 3 variable function using a Karnaugh map.

Uploaded by

Ben Gwen
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
83 views12 pages

Week 6 - Module 5 Karnaugh Maps

This document discusses Karnaugh maps, which are a graphical method for simplifying Boolean functions. Karnaugh maps arrange variables in a table to represent minterms. Minterms with a value of 1 are marked on the map. Adjacent 1 squares can be combined in groups of 2, 4, 8, etc. to find prime implicants and minimize the function. The document provides examples of 2, 3, and 4 variable Karnaugh maps and describes how to handle don't care conditions. It also prompts practicing simplifying a specific 3 variable function using a Karnaugh map.

Uploaded by

Ben Gwen
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/ 12

Week 6

Karnaugh Maps
Week 6: Karnaugh Maps

Learning Outcomes
1. Plot a function in a Karnaugh map
2. Obtain the minimum sum-of-products or products-of-sums form of a function
3. Incorporate don’t-care conditions in obtaining the minimum SOP or POS form of the
function
Week 6: Karnaugh Maps

Karnaugh Mapping
• Simple way to minimize Boolean functions
• Graphical approach
• A table or diagram of squares; each square represents a minterm
• Minterms of the function are marked (1 or 0)
• Squares with 1’s are called implicants
• Marked squares are grouped together (combined) to arrive at the simplified
expression
• The number of adjacent squares combined must be in a power of 2.
Week 6: Karnaugh Maps

Two-Variable K-Map
• Requires 2𝑛 squares, 𝑛 being the number of variables in the function
Week 6: Karnaugh Maps

Two-Variable K-Map
• 1 Square = 1 minterm (2 literals)
• 2 adjacent squares = 1 literal
• 4 adjacent squares = 1
Week 6: Karnaugh Maps

Three-Variable K-Map
• 1 Square = 1 minterm (3 literals)
• 2 adjacent squares = 1 product term with 2 literals
• 4 adjacent squares = 1 product term with 1 literal
• 8 adjacent squares = 1
Week 6: Karnaugh Maps

Four-Variable K-Map
• 1 square = 1 minterm (4 literals)
• 2 adjacent squares = 1 product term with 3 literals
• 4 adjacent squares = 1 product term with 2 literals
• 8 adjacent squares = 1 product term with 1 literal
• 16 adjacent squares = 1
Week 6: Karnaugh Maps

Prime Implicants and Essential Prime Implicants


• Prime implicant – a product term obtained by combining the maximum possible
number of adjacent squares
• Essential prime implicant – prime implicant that has at least one square that is not
covered by other prime implicants
Week 6: Karnaugh Maps

Try This!
Simplify 𝐹 𝑤, 𝑥, 𝑦, 𝑧 = ∑ 0,1,2,4,5,6,8,9,12,13,14
Week 6: Karnaugh Maps

Product-of-Sums Simplification
• Place 0’s in the squares that are not included in the function.
• Combine the 0’s into valid adjacent squares, much like combining the 1’s.
• The simplified form gives the complemented function 𝑓′.
• Obtain the complement of 𝑓′ to give back the function 𝑓 in product-of-sums form.
Week 6: Karnaugh Maps

Don’t-Care Conditions
• Minterms of the function with unspecified values; we don’t care what values these
minterms take.
• Functions with unspecified outputs are called incompletely specified functions
• Marked with 𝑋 in the map; can be 0 or 1
• May be combined with adjacent squares with 0’s and 1’s if doing so will produce the
simplest expression
Thank You!

You might also like