Scribd
Upload
86 views

Simplification Using K-Map

The document discusses the Karnaugh map method for simplifying Boolean functions. It begins by explaining the basics of the Karnaugh map and its advantages over algebraic simplification. It then provides examples of 2, 3, and 4-variable Karnaugh maps. For each, it shows how to plot the map from a truth table or Boolean expression and how to identify groupings to minimize terms in the function. The key aspects are grouping adjacent 1s in blocks of 2, 4, or 8 and identifying the common variables between these groups.

Uploaded by

Siegrique Ceasar A. Jalwin
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
86 views

Simplification Using K-Map

The document discusses the Karnaugh map method for simplifying Boolean functions. It begins by explaining the basics of the Karnaugh map and its advantages over algebraic simplification. It then provides examples of 2, 3, and 4-variable Karnaugh maps. For each, it shows how to plot the map from a truth table or Boolean expression and how to identify groupings to minimize terms in the function. The key aspects are grouping adjacent 1s in blocks of 2, 4, or 8 and identifying the common variables between these groups.

Uploaded by

Siegrique Ceasar A. Jalwin
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/ 8

CpE 301 – Logic Circuits & Design

Simplification of Boolean Function – The Map Method

The Map Method


▪ The complexity of the digital logic gates that implement a Boolean function is directly
related to the complexity of the algebraic expression from which the function is
implemented. Although the truth table representation of a function is unique, expressed
algebraically, it can appear in many different forms. Boolean functions may be simplified by
algebraic means; however, this procedure of minimization is awkward because it lacks
specific rules to predict each succeeding step in the manipulative process. The map method
provides a simple straightforward procedure for minimizing Boolean functions. This
method may be regarded either as a pictorial form of a truth table or as an extension of the
Venn diagram. The map method, first proposed by Veitch and modifies by Karnaugh, is also
known as “Veitch diagram” or the “Karnaugh map.”
▪ The map is a diagram made up of squares. Each square represents one minterm. Since any
Boolean function can be expresses as a sum of minterms, it follows that a Boolean function
is recognized graphically in the map from the area enclosed by those squares whose
minterms are included in the function. In fact, the map presents a visual diagram of all
possible ways a function may be expressed in a standard form. By recognizing various
patterns, the user can derive alterative algebraic expressions for the same function, from
which he can select the simplest one. It is assumed that the simplest algebraic expression is
any one in a sum of products or product of sums that has a minimum number of literals.

The two-variable Karnaugh Map


A two-variable map is shown in Fig. 3-1(a).
There are minterms for two variables;
hence the map consists of four squares, one
for each minterm. The map is redrawn in
(b) to show the relationship between the
squares and the two variables. The 0’s and
1’s marked for each row and each column
designate the values of variables x and y,
respectively. Notice that x appears primed
in row 0 and unprimed in row 1. Similarly,
y appears primed in column 0 and
unprimed in column 1.

We mark the squares whose minterms


belong to agiven function, the two-
bariable map becomes another useful
way to rereent any one of the 16
Boolean functions of two variable. As an
example, the function xy is shown Fig.
3-2(a). Since xy is equal to m3, a 1 is
placed inside the square that belongs to
m3. Similarly, the function x + y is
represented in the map of Fig. 3-2(b) by
three squares marked with 1’s. The
squares are found from the minterms of
function:

x + y = x’y + xy’ + xy = m1 + m2 + m3

These three squares could have also


been determined from the intersection
of variable x in the second row and
variable y in the second column, which
encloses the area belonging to x or y.

Example of a K-Map for two-variable map


An example of a Karnaugh map for a two-variable function is shown in Figure 1. Each value of the
truth table is represented in the Karnaugh map. A 1 appears in both columns of the top row.
Therefore, there exists a single product term that can cause f to be equal to 1 when the input
variables have values that correspond to either of these cells. These values have been circled and
are identified as x1 = 0, but x2 equals 0 for the left column and 1 for the right. This implies that if
x1 = 0, then f = 1, regardless of the value of x2. The product term represented by this circle is
simply images. Similarly, if x2 is 1, then regardless of x1, the function f will also equal 1. Hence,
the minimum realization for the logic function f can be expressed as

Figure 1 Karnaugh Map Simplification of a Two-Variable Logic Function

Algebraic simplification yields the same logic expression. Therefore, to find a minimum
implementation for a given logic function, it is necessary to find the smallest number of product
terms that produce a value of 1 for all cases. At the same time, the number of these product terms
should be as low as possible. Notice how some of the 1's are ...

The 3-Variable K-Map


The K-map or Karnaugh map is a graphical tool to minimize a Boolean function. From the
previous topic, you know how a Boolean function represented in canonical sum of product is
changed into sum of product form using K-map. Also, the k-map is nothing but the same truth
table in a matrix form where each of the cell is a minterm.

Truth Table for 3-Variable Map


K-map is nothing but a different representation of truth table; therefore, a truth table for 3
variables will contain 2^3 = 8 rows. This also means that the K-map would contain total of 8 cells,
each for a row in the truth table.

Consider the following truth table for three variables – A, B, and C.

Let us understand the characteristics of the 3-variable K-map because it is very


important to understand and use this map for boolean function minimization.

Characteristics of a 3-variable K-map

The truth table has total of 8 rows which corresponds to 8 cells of the 3-variable K-map.
Each cell differs in only one variable to its neighbor, both horizontally and vertically.
To minimize the terms in a boolean function, mark a cell as 1 if its output is 1 in the truth table
and leave the rest as it is.

To minimize the variables within each term of a cell that has 1 in K-map, start making groups of
2, 4, and 8.

Grouping of 1s includes neighboring cells, corners and sides even though they overlap each other.
Make larger groups if possible.

Once all 1s are covered then you can stop. Now that you know the 3-variable map and its
characteristics. It is time to see an example.

3-Variable Map Examples

Examples of 3-variable map

Question 1 – Plot a 3-variable map for the following function.

F = A'B'C' + A'B'C + AB'C

Solution:
The function use three minterms that gives output 1 as per truth table.

Solution – Three variable map with cells marked which gives output 1

Question 2 – Plot a three variable map and show grouping of two for marked cells for the
following function.

F = A'B'C + A'BC + ABC

Solution:

Solution – Cells marked as 1s are grouped into groups of two

Question 3 – Plot a three variable map for following function and make group of four cells
that are marked as 1s.

Solution:
You should note that both sides are overlapped and made into a group of 4 four because
two side when compared have a difference of 1 variable, for example, A’B’C’ and A’BC’
has only difference of B’ and B. This applies to both – horizontal and vertical directions.
The sides and corners are also neighbors of each other with a difference of 1 variable
change.

Question 4 – Minimize the following boolean function using K-Map.

F = A'B'C' + A'B'C + A'BC + AB'C + ABC'

Solution:
We will find the solution to this problem in step by step manner.

Step 1: Plot a 3-variable map and mark the terms from the function to 1.

Mark all the cells from the function as 1s.


Step 2: Make groups of 2, 4, or 8 and only take variables that are common in the group
both horizontally and vertically.
Make group of 2, 4 and 8 for cells with 1
Once you have grouped all the cells with 1s into group of 2s, 4s, or 8s. List all the
variables that are common vertically and horizontally. For example

//Group of two
= A'B'C' + A'B'C
= A' is common vertically
= B' is common horizontally
Our first term is A'B'.
//Group of four
= A'B'C + A'BC + AB'C + ABC
= A' + A cancel out vertically, leaving B'C + BC
= C is only common variable horizontally.
Our second term is C.
The final minimized equation is F = A'B'+ C

Rules for grouping in 3-variable map


• A single cell with 1 gives 3 literals.
• Two adjacent cell group gives 2 literals.
• Four cells with 1s will give a single literal.

The 4-variable Karnaugh Maps


Reductions of 4 Variable K Maps
The following four variable Karnaugh maps illustrate the reduction of Boolean
expressions too tedious for Boolean algebra. Reductions could be done with Boolean
algebra.
However, the Karnaugh map is faster and easier, especially if there are many logic
reductions to do.

The above Boolean expression has seven product terms. They are mapped top to bottom and left
to right on the K-map above. For example, the first P-term A’B’CD is the first row, 3rd cell,
corresponding to map location A=0, B=0, C=1, D=1.

The other product terms are placed in a similar manner. Encircling the largest groups possible,
two groups of four are shown above.

The dashed horizontal group corresponds to the simplified product term AB. The vertical group
corresponds to Boolean CD. Since there are two groups, there will be two product terms in the
Sum-Of-Products result of Out=AB+CD.

Fold up the corners of the map below like it is a napkin to make the four cells physically adjacent.
The four cells above are a group of four because they all have the Boolean variables B’ and D’ in
common. In other words, B=0 for the four cells, and D=0 for the four cells.

The other variables (A, C) are 0 in some cases, 1 in other cases with respect to the four corner
cells.

Thus, these variables (A, C) are not involved with this group of four. This single group comes out
of the map as one product term for the simplified result: Out=B’D’

For the K-map below, roll the top and bottom edges into a cylinder forming eight adjacent cells.

The above group of eight has one Boolean variable in common: B=0. Therefore, the one group of
eight is covered by one p-term: B’. The original eight-term Boolean expression simplifies to
Out=B’

You might also like