We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14
K-map
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: •Sum of product (SOP) •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
•Select the K-map according to the number of variables. •Identify minterms or maxterms as given in the problem. •For SOP put 1’s in blocks of K-map respective to the minterms (0’s elsewhere). •For POS put 0’s in blocks of K-map respective to the max terms (1’s elsewhere). •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. •From the groups made in step 5 find the product terms and sum them up for SOP form. SOP Vs POS SOP and POS are two of the important topics of the Boolean algebra. SOP refers to the sum of the product of the minterms, whereas POS is the Product of the sum of terms. SOP and POS help us simplify the complex Boolean variables and are mainly used in K-maps. In this article, we will explore the difference between SOP and POS. Let’s start learning on the topic of SOP vs POS. What is SOP? The SOP stands for Sum of Products defined as the sum of minterms. As the name suggests the SOP form represents the OR operation of the product terms i.e., minterms. The SOP represents the minterms in the Boolean algebra. The SOP is denoted by ∑. As the SOP deals with the minterms it works on active high logic. Example of SOP •AB + CD •P’Q + R •X’Y’ + W’Z’ SOP in K-Map The below image represents the SOP in K-map. What is POS? The POS stands for Product of Sum defined as the product of maxterms. As the name suggests the POS form represents the AND operation of the sum terms i.e., maxterms. The POS represents the maxterms in Boolean algebra. The POS is denoted by Π. As the POS deals with the maxterms it works on active low logic. Example of POS •(A + B).(C + D) •(P’ + Q).(R + S’) POS in K-Map Below image represents the POS in K-map. SOP vs POS
Characterization SOP POS
POS is the product of
Definition SOP is sum of the minterms. maxterms.
SOP stands for Sum of POS stands for Product of
Stands for Product. Sum.
Representation It represents minterms. It represents maxterms.
Logic It works on active high logic. It works on active low logic.
Denotation It is denoted by Σ. It is denoted by П.
Output The output of SOP is 1. The output of POS is 0.
SOP FORM 1. K-map of 3 variables
K-map SOP form for 3 variables
Z= ?A,B,C(1,3,6,7) From red group we get product term— A’C From green group we get product term— AB Summing these product terms we get- Final expression (A’C+AB) 2. K-map for 4 variables
K-map 4 variable SOP form
POS FORM 1. K-map of 3 variables
K-map 3 variable POS form
F(A,B,C)=?(0,3,6,7)
From red group we find terms
A B Taking complement of these two A' B' Now sum up them (A' + B') From brown group we find terms B C Taking complement of these two terms B’ C’ Now sum up them (B’+C’) From yellow group we find terms A' B' C’ Taking complement of these two ABC Now sum up them (A + B + C) We will take product of these three terms : Final expression – (A' + B’) (B’ + C’) (A + B + C) 2. K-map of 4 variables
K-map 4 variable POS form
F(A,B,C,D)=?(3,5,7,8,10,11,12,13)
From green group we find terms
C’ D B Taking their complement and summing them (C+D’+B’) From red group we find terms C D A’ Taking their complement and summing them (C’+D’+A) From blue group we find terms A C’ D’ Taking their complement and summing them (A’+C+D) From brown group we find terms A B’ C Taking their complement and summing them (A’+B+C’) Finally we express these as product – (C+D’+B’).(C’+D’+A).(A’+C+D).(A’+B+C’)