Scribd
Upload
49 views11 pages

Focus On Karnaugh Maps

Karnaugh maps (Kmaps) provide a graphical way to minimize Boolean functions by grouping adjacent 1s in the Kmap. A Kmap represents the truth table of a function with variables as the x- and y-axes and 1s corresponding to minterms. Simplification follows rules such as grouping only 1s, grouping in powers of 2, and making groups as large as possible while allowing for overlapping and wrap-around groups. Don't care conditions represented as Xs provide additional flexibility in grouping. The goal is to find the minimal representation of the function using the fewest number of groups.

Uploaded by

Ronaldo Chungkrang
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
49 views11 pages

Focus On Karnaugh Maps

Karnaugh maps (Kmaps) provide a graphical way to minimize Boolean functions by grouping adjacent 1s in the Kmap. A Kmap represents the truth table of a function with variables as the x- and y-axes and 1s corresponding to minterms. Simplification follows rules such as grouping only 1s, grouping in powers of 2, and making groups as large as possible while allowing for overlapping and wrap-around groups. Don't care conditions represented as Xs provide additional flexibility in grouping. The goal is to find the minimal representation of the function using the fewest number of groups.

Uploaded by

Ronaldo Chungkrang
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/ 11

Focus on Karnaugh Maps

Introduction
 Minimizing circuits helps reduce the number of
components in the actual physical implementation.
 Reducing Boolean expressions can be done suing
Boolean identities; however, using identities can be
very difficult because no rules are given on how or
when to use the identities.
 In this appendix, we introduce a systematic approach
for reducing Boolean expression.
Description of Kmaps and Terminology
 Karnaugh maps, or Kmaps, are graphical way to
represent Boolean functions.
 For example, if there are two input values, x and y,
there are four minterms.

FIGURE 3A.1 Minterms for Two Variables

EXAMPLE 3A.1 F(x, y) = xy


Truth Table to Kmap

• A Kmap has a cell for each


minterm.
• This means that it has a cell
for each line for the truth table
of a function.
• The truth table for the function
F(x,y) = xy is shown at the
right along with its
corresponding Kmap.
Truth Table to Kmap Example

A Kmap has a cell for each


minterm.
This means that it has a cell for
each line for the truth table of a
function.
The truth table for the function
F(x,y) = xy is shown at the right
along with its corresponding
Kmap.

6
Kmap Simplification for Two Variables
 The rules of Kmap simplification are:
1) Groupings can contain only 1s; no 0s.
2) Only 1s in adjacent cells can be grouped;
diagonal grouping is not allowed.
4) The number of 1s in a group must be a
power of 2
5) The groups must be made as large as
possible
while still following all rules.
6) All 1s must belong a group, even if it is a
group of one.
7) Overlapping groups are allowed.
8) Wrap around is allowed.
9)Use the fewest number of groups possible.

FIGURE 3A.3 Kmap for F(x, y) = x + y


Kmap Simplification for Three Variables

A Kmap for three variables is constructed as shown in


the diagram below.
We have placed each minterm in the cell that will hold
its value.
Notice that the values for the yz combination at the top of
the matrix form a pattern that is not a normal binary
sequence.

Pattern must be
like this. Only 1
variable changes
at a time

Lecture 8 Dr. Clincy


Don’t Care Conditions
Real circuits don’t always need to have an output
defined for every possible input.
For example, some calculator displays consist of 7-segment
LEDs. These LEDs can display 2 7 -1 patterns, but only ten of
them are useful.
If a circuit is designed so that a particular set of inputs
can never happen, we call this set of inputs a don’t
care condition.
They are very helpful to us in Kmap circuit
simplification.

Lecture 9 Dr. Clincy


Don’t Care Conditions
In a Kmap, a don’t care condition is identified by an X in the cell of the
minterm(s) for the don’t care inputs, as shown below.
In performing the simplification, we are free to include or ignore the X’s when
creating our groups.

• Reduction using don’t cares:

Lecture 10 Dr. Clincy


Summary
 Using Boolean identities for reduction is awkward
and can be very difficult.
 Kmaps provide a precise of steps to follow to find the
minimal representation of a function, and thus the
minimal circuit that function represents.
 The rules of Kmap simplification are:
1)Groupings can contain only 1s; no 0s
2)Only 1s in adjacent cells can be grouped;
diagonal grouping is not allowed.
3)The number of 1s in a group must be a power of
2.
4)The groups must be made as large as possible
while still following all rules.
5)All 1s must belong a group, even if it is a group of
one.
6)Overlapping groups are allowed.
7)Wrap around is allowed.
8)Use the fewest number of groups possible.

You might also like