Scribd
Upload
4 views18 pages

Kmap 3var

The document discusses Karnaugh Maps (K-Maps), a graphical tool used to simplify Boolean expressions by representing truth tables. It explains the construction of K-Maps, including their structure for single and multiple variables, and provides examples of grouping minterms and maxterms to derive simplified Boolean functions. The historical context of the K-Map's development is also mentioned, highlighting contributions from E.W. Veitch and Maurice Karnaugh.

Uploaded by

akhil2024mm333
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
4 views18 pages

Kmap 3var

The document discusses Karnaugh Maps (K-Maps), a graphical tool used to simplify Boolean expressions by representing truth tables. It explains the construction of K-Maps, including their structure for single and multiple variables, and provides examples of grouping minterms and maxterms to derive simplified Boolean functions. The historical context of the K-Map's development is also mentioned, highlighting contributions from E.W. Veitch and Maurice Karnaugh.

Uploaded by

akhil2024mm333
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/ 18

Boolean Algebra

Naveen Kumar .V
Karnaugh Map

• A graphical display of the fundamental products in a truth


table used to simplify Boolean expressions.
• Fundamental Product: The logical product of variables and
complements that produces a high output for a given input
condition.
• The map method provides simple procedure for minimizing
the Boolean function.
• The map method was first proposed by E.W. Veitch in 1952
known as “Veitch Diagram”.
• In 1953, Maurice Karnaugh proposed “Karnaugh Map” also
known as “K-Map”.
Construction of K-Map

• The K-Map is a pictorial representation of a truth table made


up of squares.
• Each square represents a Minterm or Maxterm.
• A K-Map for n variables is made up of 2ⁿ squares.

Single Variable K-Map


• A one variable K-Map is shown in the following figure.
• The one variable Boolean expression is of the form f(A).
• There are two Minterms (A and A’ ) for one variable
F(A,B) = Ʃ(0,1,2)

Pair1 = m0+m1
= A’
Pair 2= m0+m2
= B’
F(A,B) = A’+B’
Rules for grouping
General structure and grouping of
3 variable k-map
3 variable k-maps
F(x,y,z)= Ʃ(1,2,3,5)

Quad 1 = m4+m5+m6+m7
=A Pair1 = m1+m5
Quad 2 = m0+m2+m4+m6 = Y’Z
=C Pair2 = m2+m3
There fore Y= A+C X’Y
There fore F(X,Y,Z) = Y’Z+X’Y
F(A,B,C)=Ʃ(0,1,4,6,7)
POS Expression solving using K-maps

You might also like