Scribd
Upload
48 views28 pages

1.4 K Maps

This document provides an overview of Karnaugh maps and their use in simplifying Boolean expressions. It defines canonical form, explains how to convert expressions to canonical form, and introduces Karnaugh maps as a graphical technique to group variables and minimize logic expressions. The document outlines the rules for constructing and simplifying Karnaugh maps through grouping, includes examples of simplifying 2, 3, and 4 variable maps, and provides exercises for practicing Karnaugh map simplification.

Uploaded by

Brian Ombura Okal
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
48 views28 pages

1.4 K Maps

This document provides an overview of Karnaugh maps and their use in simplifying Boolean expressions. It defines canonical form, explains how to convert expressions to canonical form, and introduces Karnaugh maps as a graphical technique to group variables and minimize logic expressions. The document outlines the rules for constructing and simplifying Karnaugh maps through grouping, includes examples of simplifying 2, 3, and 4 variable maps, and provides exercises for practicing Karnaugh map simplification.

Uploaded by

Brian Ombura Okal
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/ 28

Welcome

Learning Objectives
On the successful completion of this session you
will be able to:
• Explain the concept of the K-Map
• Explain the canonical form of the Boolean
expression
• Convert the Non-canonical form to canonical
form.
• Simplify the Boolean expression with K-Map.
Canonical Form
• When each term of a logic expression contains
all variables, it is said to be in the canonical
form. When a sum of product form of logic
expression is in canonical form, each product
term is called a minterm. Each minterm contains
all variables. The canonical form of a sum of
products expression is also called minterm
canonical form or standard sum of product.
How to convert into Canonical Form
• If the expression is not in canonical form, first we need to convert it into
canonical form then we can use it for simplification with K-maps.
• For Example, Express the Boolean function F = x + y z into its canonical
form.
• Solution: This function has three variables: x, y, and z. All terms must have
these three variables. Thus, we need to expand the first term by ANDing it
with (y + y') (z + z'), and we expand the second term with (x + x') to get
• F=x+yz
• = x (y + y') (z + z') + (x + x') y z
• = x y z + x y z' + x y' z + x y' z' + x y z + x' y z
• = x' y z + x y' z' + x y' z + x y z' + x y z
• = m3 + m4 + m5 + m6 + m7
• = Σ(3, 4, 5, 6, 7)
Karnaugh Map
Karnaugh Map
• The Karnaugh map method is a graphical
technique for simplifying Boolean function. The
Karnaugh map is a two-dimensional
representation of a truth table. It provides a
simpler method for minimizing logic expression.
The map method is ideally suited for four or less
variables. But it becomes cumbersome for five
or more variables.
What is Karnaugh Map?
• The Karnaugh map, also known as the K-map, is a
method to simplify Boolean algebra expressions. The
Karnaugh map reduces the need for extensive
calculations.
• A Karnaugh map provides a pictorial method of
grouping together expressions with common factors
and therefore eliminating unwanted variables.
• Karnaugh maps are used to simplify Boolean
expressions so that they can be implemented using a
minimum number of physical logic gates.
Graphical representation of 2 and3
• 2-variable map
Graphical representation of 2 and3
• 3-variable map
Graphical representation
4 variable K-Map:
Steps to create K-Map:
• Convert the Boolean expression in canonical form.
• Draw the map by using Gray code.
• Construct the K-map and place 1’s in the squares according to the
SOP expression or truth table
• Find the largest grouping of 1’s that are not already all in a group;
if there is more than one possibility; choose a grouping that
minimizes the total number of groups
• Repeat step 2 until only isolated 1’s remaining.
• Form single groups of the remaining isolated 1’s.
• Find the product term that corresponds to each group.
• Summingtheresultingproductterms
Rules of Simplification through K-Maps

• No zeroes allowed.
• No diagonals.
• Only power of 2 numbers of cells in each group.
• Groups should be as large as possible.
• Every 1 must be in at least one group.
• Overlapping allowed.
• Wrap around allowed.
• Fewest numbers of groups possible.
K-Map: Rules of Grouping
•Each group should be as large as possible.

•Groups may be horizontal or vertical, but not diagonal.


K-Map: Rules of Simplification (Cont.)
•Groups must contain 1, 2, 4, 8, or in general 2n cells. That is if n = 1, a group will contain
two 1's since 21 = 2. If n = 2, a group will contain four 1's since 22 = 4.
K-Map: Rules of Simplification (Cont.)
•Groups may wrap around the table. The leftmost cell in a row may be grouped with the
rightmost cell and the top cell in a column may be grouped with the bottom cell.
Summary of Rules for grouping
1. No zeros allowed.
2. No diagonals.
3. Only power of 2 number of cells in each group.
4. Groups should be as large as possible.
5. Every one must be in at least one group.
6. Overlapping allowed.
7. Wrap around allowed.
8. Fewest number of groups possible.
Simplify 2-variable K-map
• Example 1.
Simplify 2-variable K-map
Simplify 2-variable K-map
• Example 3: Simplify Y = A’B’ + A’B
Simplify 3-variable K-Map
Simplify 3-variable K-Map
Simplify 3-variable K-Map
Example 3: Simplify : A’B’C’ + A’BC’ + ABC’
Simplify 4-variable K-map
Simplify 4-variable K-map
• Simplify : A’B’C’D’ + A’BC’D +ABC’D + AB’C’D +ABCD’ + AB’CD’
Simplify 4-variable K-map
• Example 3: A’BC’D’ + A’B’C’D +AB’C’D+A’B’CD+AB’CD + A’BCD’
Simplify 4-variable K-map
• Draw K-map for the following Boolean function
Y(A,B,C,D) =Y( 4,5,10,11,15)
Exercises
• Using the tabular method of simplification, find all equally minimal solutions for the function below.
Z = f(A,B,C,D) = (1,4,5,10,12,14)
• Simplify the following Boolean function using K-Map simplification for three variables.
• F (a, b, c) = ∑ (0, 1, 2, 5, 7)
• F (w,x,y,z) = ∑ (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
• For the function:
• F = B+ AB + A C + A B C + A C + C
• Construct a Karnaugh map and use it to find a minimum sum of products expression for F and draw a logic circuit for the
minimized sum of products expression for f using AND, OR and NOT gates.
• Map the function having four variables in Karnaugh’s map. The function is
• F(A,B,C,D) = ∑(2,6,10,14).
• Simplify following with K-maps:
– F(A,B)=∑(1,2,3)
– F(A,B,C)=B++AB+A
– F(A,B,C)=BC+A
– F(A,B,C)=+C
– F(A,B,C,D)=+A+A+ABC+C
– F(A,B,C,D)=A++BD+BCD+ABD
– F(A,B,C,D)=+C+A+AC
– F(A,B,C,D)=∑(1,3,4,6,9,11)
– F(A,B,C,D)=∑(2,3,6,7,12,13,14,15)
– F(A,B,C,D)=CD+BCD+ABCD+ACD+ACD+AB+ABD+ABC
Thank you !

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy