Scribd
Upload
24 views11 pages

K - Map

The document discusses Karnaugh maps, which are a graphical method to simplify boolean expressions. Karnaugh maps arrange variables in a grid, with cells filled according to 1s and 0s in the boolean expression. Groups of adjacent 1 cells are combined using simplification rules to minimize the expression.

Uploaded by

santosh barik
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
24 views11 pages

K - Map

The document discusses Karnaugh maps, which are a graphical method to simplify boolean expressions. Karnaugh maps arrange variables in a grid, with cells filled according to 1s and 0s in the boolean expression. Groups of adjacent 1 cells are combined using simplification rules to minimize the expression.

Uploaded by

santosh barik
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/ 11

Karnaugh Map (K- Map)

• The Karnaugh Map also called as K Map is a graphical


representation that provides a systematic method for
simplifying the boolean expressions.
• For a boolean expression consisting of n-variables, number of cells required
in K Map = 2n cells.
Three variable K Map may be represented as-

Here, A, B and C are the three variables of the given boolean function.
• Four Variable K Map-
• Four variable K Map is drawn for a boolean expression
consisting of four variables.
• The number of cells present in four variable K Map = 24 = 16
cells.
• So, for a boolean function consisting of four variables, we
draw a 4 x 4 K Map.
• Four variable K Map may be represented as-
Karnaugh Map Simplification Rules-
• To minimize the given boolean function,
• We draw a K Map according to the number of
variables it contains.
• We fill the K Map with 0’s and 1’s according to its
function.
• Then, we minimize the function in accordance with
the following rules.
• Rule-01:
• We can either group 0’s with 0’s or 1’s with 1’s but we can not
group 0’s and 1’s together.
• X representing don’t care can be grouped with 0’s as well as 1’s.
• Rule-02:
• Groups may overlap each other.
• Rule-03:
• We can only create a group whose number of cells can be
represented in the power of 2.
• In other words, a group can only contain 2n i.e. 1, 2, 4, 8, 16
and so on number of cells.
• Rule-06:
• Opposite grouping and corner grouping are allowed.
• The example of opposite grouping is shown illustrated in Rule-05.
• The example of corner grouping is shown below.
Example: Minimize the following boolean
function- F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9,
10, 13, 15)
• Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map. We fill the
cells of K Map in accordance with the given boolean function. Then, we form the groups
in accordance with the above rules. Then, we have-

You might also like