Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views16 pages

Karnaugh Maps Introduction

Karnaugh Maps (K-maps) are a tool for simplifying Boolean functions to achieve minimal sum of products (MSP) expressions, which lead to simpler hardware implementations. The document explains the standard forms of expressions, the use of minterms, and the process of K-map simplification, including examples for two, three, and four-variable functions. It also highlights the importance of grouping adjacent cells in K-maps to facilitate simplification and mentions that multiple MSP possibilities can arise from the same function.

Uploaded by

snehalkulkarni.tcoer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views16 pages

Karnaugh Maps Introduction

Karnaugh Maps (K-maps) are a tool for simplifying Boolean functions to achieve minimal sum of products (MSP) expressions, which lead to simpler hardware implementations. The document explains the standard forms of expressions, the use of minterms, and the process of K-map simplification, including examples for two, three, and four-variable functions. It also highlights the importance of grouping adjacent cells in K-maps to facilitate simplification and mentions that multiple MSP possibilities can arise from the same function.

Uploaded by

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

Karnaugh Maps

• Lecture 3
• Simplification of Boolean Functions using K-
Maps
Introduction to Karnaugh Maps
• Boolean expressions can be simplified using K-
maps.
• K-maps lead to minimal sum of products
(MSP) expressions.
• Minimal terms and literals → simpler
hardware implementation.
Standard Forms of Expressions
• Sum of Products (SOP): OR at the outermost
level.
• Each term is a product of literals.
• Can be implemented with two-level logic
circuits.
Minterms and Their Use
• Minterm: a product term with all variables
appearing once.
• A function with n variables has 2^n minterms.
• Each minterm is true for exactly one
combination of inputs.
Sum of Minterms Form
• Functions can be written as a sum of
minterms.
• Use truth tables to extract rows with output 1.
• Example: f = Σm(0,1,2,3,6)
Rearranging the Truth Table
• Two-variable functions: 4 minterms arranged
into a 2x2 K-map.
• Adjacent cells share one literal.
• Facilitates simplification by grouping.
K-Map Simplification Example
• Example: x’y’ + x’y → x’
• Example: x’y + xy → y
• Example: x’y’ + x’y + xy → x’ + y
Three-variable Karnaugh Maps
• Arrangement ensures adjacent squares differ
by one literal.
• Simplification uses groups of 2, 4, or 8 cells.
• Can wrap around sides for grouping.
K-map Simplification Process
• Convert function to sum of minterms (if
needed).
• Draw truth table → fill in K-map.
• Group adjacent 1s into rectangles of 2^n size.
Example: f(x,y,z) = xy + y’z + xz
• Truth table → K-map → Grouping
• Simplified result: y’z + xy
K-map from Truth Tables
• Each row i → cell mi in K-map.
• Mind the Gray code ordering for correct
adjacency.
Grouping Minterms
• Group 1s into sizes of 1, 2, 4, 8 etc.
• Each group corresponds to one product term.
• Overlapping groups allowed for better
simplification.
Four-variable Karnaugh Maps
• Minterms arranged in 4x4 grid with Gray code
ordering.
• Group sizes: 1, 2, 4, 8, or 16.
• Edges wrap around (top-bottom, left-right).
Example: Simplify
m0+m2+m5+m8+m10+m13
• K-map grouping → x’z’ + xy’z
Multiple MSP Possibilities
• K-map may yield more than one minimal
expression.
• Example: y’z + yz’ + xy = y’z + yz’ + xz
• All valid simplifications.
Assignment
• 1. Explain K-map. Why we use it?
• 2. What do you mean by 3-bit and 4-bit K-
map?
• 3. Design a K-map for 3 variables.

You might also like