Scribd
Upload
16 views3 pages

k map deco

The document introduces Karnaugh Maps (K-maps) as a method for minimizing Boolean expressions with 3 or 4 variables without using Boolean algebra theorems. It outlines the two forms of K-maps: Sum of Products (SOP) and Product of Sums (POS), and provides steps for solving expressions using K-maps, including filling the grid and making groups. The document also includes references to K-map representations for both 3 and 4 variables.

Uploaded by

mohanpaul857
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
16 views3 pages

k map deco

The document introduces Karnaugh Maps (K-maps) as a method for minimizing Boolean expressions with 3 or 4 variables without using Boolean algebra theorems. It outlines the two forms of K-maps: Sum of Products (SOP) and Product of Sums (POS), and provides steps for solving expressions using K-maps, including filling the grid and making groups. The document also includes references to K-map representations for both 3 and 4 variables.

Uploaded by

mohanpaul857
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/ 3

Introduction of K-Map (Karnaugh Map)


In many digital circuits and practical problems, we need to find expressions with minimum variables. We can
minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra
theorems.
K-map can take two forms:
1. Sum of product (SOP)
1. Product of Sum (POS)
According to the need of problem. K-map is a table-like representation, but it gives more information than the
TABLE. We fill a grid of the K-map with 0’s and 1’s then solve it by making groups.

Steps to Solve Expression using K-map


1. Select the K-map according to the number of variables.
1. Identify minterms or maxterms as given in the problem.
1. For SOP put 1’s in blocks of K-map respective to the minterms (0’s elsewhere).
1. For POS put 0’s in blocks of K-map respective to the max terms (1’s elsewhere).
1. Make rectangular groups containing total terms in power of two like 2,4,8 ..(except 1) and try to cover as
many elements as you can in one group.
1. From the groups made in step 5 find the product terms and sum them up for SOP form.

SOP FORM
1. K-map of 3 variables:
2. K-map for 4 variables:

POS FORM
1. K-map of 3 variables:

2. K-map of 4 variables

You might also like