0% found this document useful (0 votes)
416 views17 pages

K-Map (Karnaugh Map)

The Karnaugh map is a method for simplifying Boolean algebra expressions that was developed by Maurice Karnaugh in 1953. It provides an intuitive graphical representation of the truth table for functions with up to four variables. Users map the minterms or maxterms onto a grid and then group adjacent cells to find simplified sum-of-products or product-of-sums expressions. The steps involve drawing the K-map, identifying groupings of 2, 4, 8 cells and covering as many as possible to minimize variables. This method allows for simplifying Boolean logic visually without using algebraic theorems.

Uploaded by

mathan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
416 views17 pages

K-Map (Karnaugh Map)

The Karnaugh map is a method for simplifying Boolean algebra expressions that was developed by Maurice Karnaugh in 1953. It provides an intuitive graphical representation of the truth table for functions with up to four variables. Users map the minterms or maxterms onto a grid and then group adjacent cells to find simplified sum-of-products or product-of-sums expressions. The steps involve drawing the K-map, identifying groupings of 2, 4, 8 cells and covering as many as possible to minimize variables. This method allows for simplifying Boolean logic visually without using algebraic theorems.

Uploaded by

mathan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

KARNAUGH MAP

Who Developed the K-Map?


Maurice Karnaugh, a
telecommunications engineer,
developed the Karnaugh map at
Bell Labs in 1953 while designing
digital logic based telephone
switching circuits.
Definition of K-MAP
• In many digital circuits and practical problems we need to find expression 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) and Product Of Sum (POS)
according to the need of problem.
• K-map is table like representation but it gives more information than TRUTH
TABLE. We fill grid of K-map with 0’s and 1’s then solve it by making groups.
STEPS TO SOLVE
EXPRESSION USING K-MAP
1. Select K-map according to the number of variables.
2. Identify minterms or maxterms as given in problem.
3. For SOP put 1’s in blocks of K-map respective to the minterms (0’s
elsewhere).
4. For POS put 0’s in blocks of K-map respective to the maxterms (1’s
elsewhere).
5. 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.
6. From the groups made in step 5 find the product terms and sum them up for
SOP form.
TRUTH TABLE OF K-MAP
USING TWO VARIABLE MAP
 The Starting Point For Digital Circuit Design Is Usually The Truth Table Which
Gives Us The Following Information:
 Under Which Input Condition Occurs A Certain Output Condition.
Ex:
TRUTH TABLE OF K-MAP
USING THREE VARIABLE MAP
The truth table outputs are translated into the Karnaugh map. Each position in the map represents a certain
fundamental product.
TRUTH TABLE OF K-MAP
USING FOUR VARIABLE MAP
Many digital systems process 4 bit numbers. For this reason, logic circuits are often designed to handle 4 input
variables . Ex:
GROUPING CELLS FOR
SIMPLIFICATION

There Are Four Types


1. Single
2. Pairs
3. Quads
4. Octets
PAIRS
QUAD
OCTET
KARNAUGH SIMPLIFICATIONS

1. Draw the Karnaugh map


2. Look for octets and encircle them.
3. Look for quads and encircle them.
4. Look for pairs and encircle them.
5. Simplify and write down the equation.
SOP FORM

Map Of 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)
SOP FORM

K-map for 4 variables:-


F(P,Q,R,S)=∑(0,2,5,7,8,10,13,15)
 From red group we get product term
QS
 From green group we get product term
Q’S’
 Summing these product terms
 we get- Final expression (QS+Q’S’)
POS FORM
K-MAP OF 3 VARIABLES:-
• F(A,B,C)=Π(0,3,6,7)
• FROM RED GROUP WE FIND TERMS A B C’
• TAKING COMPLEMENT OF THESE TWO A’ B’ C
• NOW SUM UP THEM (A’ + B’ + C)
• FROM GREEN GROUP WE FIND TERMS B C
• TAKING COMPLEMENT OF THESE TWO TERMS B’ C’
• NOW SUM UP THEM (B’+C’)
• FROM BROWN 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’ + C) (B’ + C’) (A + B + C)
POS FORM
K-MAP OF 4 VARIABLES:-
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’)
• PITFALL– *ALWAYS REMEMBER POS ≠ (SOP)’
• *THE CORRECT FORM IS (POS OF F)=(SOP OF F’)’
THANKYOU

You might also like