Scribd
Upload
160 views6 pages

2 & 3 Variable K Map

Uploaded by

prabhatpatel400
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
160 views6 pages

2 & 3 Variable K Map

Uploaded by

prabhatpatel400
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

2 & 3 Variable K Map:

K map: A Karnaugh map (K-map) is a diagram used in digital logic design and
Boolean algebra to simplify complex Boolean expressions and find the Boolean
expression. It helps to minimize the number of logical operations (AND, OR,
NOT) needed to express a given Boolean function, which can simplify the design
of digital circuits.

Type of K map:
1. 2 variable K map
2. 3 variable K map
3. 4 variable K map
4. 5 or more variable K map.
Before to study K map we want to know following some important Definition like
SOP, POS, Minterms & Maxterms.
• SOP : SOP mean sum of product of variables. Each product terms can be
contain variable or their complement. If each product term contain all variable
then those SOP form is called standard SOP form.
Eg. Consider a function of two variable A&B such that
F(A,B)= A’.B’ +A’.B +A.B
• POS: POS mean product of sum of variables. Each sum terms can be contain
variables or their Complement. If each sums terms contain all variable then
those POS form is call standard POS form.
Eg. Consider a function of two variable A&B such that
F(A,B)= (A+B).(A+B’).(A’+B)
Minterms and Maxterms: Each of the product terms in the standard SOP form is
called Minterms and each of the sums terms in the standard POS form is called
Maxterms.
For simplicity the Minterm and Maxterm are represented as binary word in terms
of 0s and 1s. Instead of actual variable. For Minterms the binary word are formed
by representing each non-complemented variable by a 1 and each complemented
variable by a 0, and the decimal equivalent of this binary word is expressed as a
subscript of lower case m ie m0 , m1 etc. For maxterms, the binary words are
formed by representing each non-complemented variable by a 0 and each
complemented variable by a 1, and the decimal equivalent of this binary word is
expressed as a subscript of the upper case letter M, i.e. M0, M₁, etc. Any given
function which is not in the standard form, can always be converted to standard
form.
Eg. Expand A’ +B’ to minterm and maxterm.
𝐴′ + 𝐵 ′ = 𝐴′ (𝐵 + 𝐵 ′ ) + 𝐵 ′ (𝐴 + 𝐴′ )
= 𝐴′ 𝐵 + 𝐴′ 𝐵 ′ + 𝐴𝐵 ′ + 𝐴′ 𝐵 ′
= 𝐴′ 𝐵 ′ + 𝐴′ 𝐵 + 𝐴𝐵 ′
= 00 + 01 + 10
= m0 +m1 + m2. ( Minterm representation)
= M3. ( Maxterm reprentation)

1) 2 Variable K map: (A) SOP form: A two-variable K-map has 2²= 4


squares. These squares are called cells. Each square on the K-map represents a
unique minterm(in SOP form). The minterm designations of the squares are
shown in Fig. 1 placed in any square indicates that the corresponding minterm
is included in the output expression, and a 0 or no entry in any square indicates
that the corresponding minterm does not appear in the expression for output.
Eg. Reduce the expression A’ B’ + A’B + AB using mapping.
Solution .Expressed in terms of minterms, the given expression is m(0, 1, 3)
The diagram below shows the K-map and its reduction. In one 2-square, A is
constant as a 0 but B varys from a 0 to a 1, and in the other 2-square, B is constant
as a 1 but A varys from a 0 to a 1. So, the reduced expression is A’ + B.

(B)POS Form. For mapping a POS expression on to the K-map, Os are placed in
the squares corresponding to the maxterms which are present in the expression and
1s are placed (or no entries are made) in the squares corresponding to the
maxterms which are not present in the expression. The decimal designation of the
squares for maxterms is the same as that for the minterms. A two-variable K-map
and the associated maxterms are shown in Fig.

Eg.Reduce the expression (A+B)(A+B’)(A’+B’) using mapping.


The given expression in terms of maxterms is M(0, 1, 3). The diagram below
shows the K-map and its reduction. It requires two gate inputs for realization of the
reduced expression. In the given expression, the maxterm M₂ is absent. This is
indicated by 1 on the K-map. The corresponding SOP expression is ∑ m2 or AB.

This realization is the same as that for the POS form.

2. 3 Variable K map:
(A)SOP FormA function in three variables (A, B, C) expressed in the SOP form
can have eight possible combinations: A’B’C’ , A’B’C, A’BC’ A’BC AB’C’ AB’C
ABC’ and ABC. Each one of these combinations designated by

∑m(0,1,2,3,4,5,6,7)respectively, is called a minterm. A is the MSB of the minterm


designator and C is the LSB.
Eg.Reduce the expression ∑m(0,2,3,4,5,6) using mapping

K-map and its reduction as shown above.

(B)POS form: In the POS form, the eight possible combinations


are: A+ B+C, A+B+C’, A+B’+C, A+B’+C’ , A’+B+C,
A’+B+C’ A’+ B’+C and A’+B’+C’.Each one of these
combinations designated by M0 M1, M2, M3, M4, M5, M6 and
M7 respectively, is called Maxterms.

Eg.Reduce the expression M(0,1,2,3,4,7) using mapping.


K map and its reduction as shown below.

You might also like