Scribd
Upload
5 views

06. Karnaugh Map - II

The document explains the Karnaugh map (K-map) method for minimizing Boolean expressions without using Boolean algebra. It details the steps for solving expressions using K-maps for both Sum of Products (SOP) and Product of Sums (POS) forms, along with examples for 3 and 4 variable K-maps. Additionally, it includes practice problems related to K-maps.

Uploaded by

birendrabarik589
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
5 views

06. Karnaugh Map - II

The document explains the Karnaugh map (K-map) method for minimizing Boolean expressions without using Boolean algebra. It details the steps for solving expressions using K-maps for both Sum of Products (SOP) and Product of Sums (POS) forms, along with examples for 3 and 4 variable K-maps. Additionally, it includes practice problems related to K-maps.

Uploaded by

birendrabarik589
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/ 6

Digital Logic(U-I) @RKS

K-Map (Karnaugh Map)


A Karnaugh map or a K-map refers to a pictorial method that is utilized to minimize
various Boolean expressions without using the Boolean algebra theorems along with the
equation manipulations.

A Karnaugh map can be a special version of the truth table. We can easily minimise
various expressions that have 2 to 4 variables using a K-map.

Introduction of K-Map (Karnaugh Map)


In numerous digital circuits and other practical problems, finding expressions that have
minimum variables becomes a prerequisite. In such cases, minimization of Boolean
expressions is possible that have 3, 4 variables. It can be done using the Karnaugh map
without using any theorems of Boolean algebra. The K-map can easily take two forms,
namely, Sum of Product or SOP and Product of Sum or POS, according to what we need
in the problem. K-map is a representation that is table-like, but it gives more data than the
TRUTH TABLE. Fill a grid of K-map with 1s and 0s, then solve it by creating various
groups.

Solving an Expression Using K-Map


Here are the steps that are used to solve an expression using the K-map method:

1. Select a K-map according to the total number of variables.

2. Identify maxterms or minterms as given in the problem.

3. For SOP, put the 1’s in the blocks of the K-map with respect to the minterms
(elsewhere 0’s).

4. For POS, putting 0’s in the blocks of the K-map with respect to the maxterms
(elsewhere 1’s).

5. Making rectangular groups that contain the total terms in the power of two, such as
2,4,8 ..(except 1) and trying to cover as many numbers of elements as we can in a
single group.

6. From the groups that have been created in step 5, find the product terms and then
sum them up for the SOP form.

1|Page
Digital Logic(U-I) @RKS

SOP FORM
1. 3 variables K-map:

F (A, B, C) = ∑ (1, 3, 6, 7)

From the red group, the product term would be — A’C

From the green group, the product term would be —AB

If we sum these product terms, then we will get this final expression

F = (A’C + AB)

2|Page
Digital Logic(U-I) @RKS

2. 4 variables K-map:
F (A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15)

From the red group, the product term would be — BD

From the lilac group, the product term would be — B’D’

If we sum these product terms, then we will get this final expression

F = (BD + B’D’)

3|Page
Digital Logic(U-I) @RKS

POS FORM
1. 3 variables K-map
F (A, B, C) = π(0,3,6,7)

1. From the lilac group, the terms would be: A B


If we take the complement of these two : (AB)’ = (A’ + B’)

2. From the blue group, the terms would be: B C


When we take the complement of these terms : (B R)’ = (B’ + R’)

3. From the red group, the terms would be: P’ Q’ R’


If we take the complement of the two terms; (P Q R)’ = (P + Q + R)

If we take the product of these three terms, then we will get this final expression –

F = (P’ + Q’) (P’ + R’) (P + Q + R)

4|Page
Digital Logic(U-I) @RKS

2. 4 variables K-map
F (A, B, C, D) = π (3, 5, 7, 8, 10, 11, 12, 13)

 From the group-1, the terms would be: B C’ D


We take their complement and then sum them: (B’ + C+ D’)

 From the red group-2, the terms would be: A C’ D’


We take their complement and then sum them: (A’ + C + D)

 From the purple group-3, the terms would be : A’ C D


We take their complement and then sum them: (A + C’+ D’)

 From the lilac group-4, the terms would be: A B’ C


We take their complement and then sum them: (A’ + B + C’)

Finally, we will express these in the form of the product –

F = (B’ + C+ D’) . (A’ + C + D) . (A + C’+ D’) . (A’ + B + C’)

Pitfall – Always remember that POS ≠ (SOP)’

*Here, the correct form would be (POS of F) = (SOP of F’)’

5|Page
Digital Logic(U-I) @RKS

Practice Problems on Introduction of Karnaugh Map


1. There are a total of ______ cells in a K-map with 4-variable.

a) 8 b) 18 c) 16 d) 12

2. The don’t care condition could be used in order to simplify the Boolean expressions in
the ___________.

a) Latches b) K-maps c) Terms d) Registers

3. Logic gates can be widely used in the _______________ design and are therefore
available in the IC form.

a) Digital b) Sampling c) Systems d) Analog

4. Entries are also called the _______________ mapping.

a) Boolean b) K c) Straight d) Diagonal

6|Page

You might also like