Group11 K-Map

K-MAP
Unlocking the Power of Karnaugh Maps:

Simplifying Complex Logic
TEAM MEMBER :-
MANISH KHATRI | PARTH SIKKA | ROMI GUPTA | AFROZ AKHTER
Table of contents
01 02 03
Why K-Map ? When K-Map ? How K-Map ?
04 05 06
K-Map Method Standard Conclusions
Canonical Form
01
WHY K-MAP
1. F(A,B) = A.B 2. F(A,B) = A’.B + A.B
3. F(A,B,C) = A’.B’.C + A.B.C + A’.B.C”

ADVANTAGE OF K-MAP
What about Cost?
K-maps can potentially lead to simpler circuit designs compared to Boolean algebra methods. Simpler
designs often require fewer components, reducing the overall cost of the circuit.
What about Delay?

K-maps aid in the reduction of the number of logic gates, which can minimize signal propagation delay
within the circuit. By minimizing delay, circuits can operate faster, which is crucial in high-speed
applications.
What about Complex?

K-maps offer a visual and intuitive way to simplify Boolean expressions. They can efficiently handle
simplification of larger Boolean functions, reducing complexity in terms of the number of terms, gates,
and overall circuitry.
02
WHEN K-MAP
WHEN WE USE K-MAP
What about Complex Handling?
K-maps excel when dealing with intricate Boolean expressions involving four or more variables. They
simplify the process of minimizing complex functions that might become cumbersome when using
traditional algebraic manipulations.
What about Visual Representation?

K-maps offer a visual layout where adjacent cells can be easily grouped to simplify expressions. This
visual aid makes it easier to identify patterns and quickly reduce expressions, offering a more
intuitive approach compared to abstract algebraic transformations.
What about Efficient Circuit Diagram?

They are beneficial in optimizing logic circuits, reducing the number of gates required. This efficiency
in design helps minimize hardware complexity, lower costs, and improve circuit speed, especially in
scenarios where compact, streamlined designs are essential.
03
HOW K-MAP
RULES TO OBTAIN THE MOST SIMPLIFIED
EXPRESSION :
Rule No. 1
Simplification of logic expression using Boolean algebra is awkward because:
- it lacks specific rules to predict the most suitable next step in the simplification process
- it is difficult to determine whether the simplest form has been achieved.
Rule No. 2
A Karnaugh map is a graphical method used to obtained the most simplified form
of an expression in a standard form (Sum-of-Products or Product-of-Sums).
Rule No. 3
The simplest form of an expression is the one that has the minimum number of
terms with the least number of literals (variables) in each term.
RULES TO OBTAIN THE MOST SIMPLIFIED
EXPRESSION :
Rule No. 4
By simplifying an expression to the one that uses the minimum number of terms, we ensure
that the function will be implemented with the minimum number of gates.
Rule No. 5
By simplifying an expression to the one that uses the least number of literals for each
terms, we ensure that the function will be implemented with gates that have the minimum
number of inputs.
K-MAP METHODS
K-Map Function
SOP FORM POS FORM

● Represents a Boolean expression as a ● Represents a Boolean expression as a
SUM (OR) of product terms. PRODUCT(AND) of SUM terms.
● Utilizes AND gates followed by OR gates. ● Utilizes OR gates followed by AND gates.
● Involves grouping minterms for ● Involves grouping maxterms for
simplification. simplification.
● Written as Σ(minterms) or as a sum of ● Written as Π(maxterms) or as a sum of
products. products.
● G(x,y,z)=Σ(m2,m4,m6) ● G(x,y,z)=Π(M1,M3,M5,M7)
3-VARIABLE MAP
f =  (0,4) = B C f =  (4,5) = A B f =  (0,1,4,5) = B f =  (0,1,2,3) = A
BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 1
1 1 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 0 0 0
f =  (0,4) = A C f =  (4,6) = A C f =  (0,2) = A C f =  (0,2,4,6) = C
BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 0 1 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1
1 0 0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1
4-VARIABLE MAP
CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 1 0 0 0 00 0 0 0 0 00 0 0 0 0 00 0 0 0 0
01 0 0 0 0 01 0 1 0 0 01 0 0 0 0 01 1 0 0 1
11 0 0 0 0 11 0 1 0 0 11 0 1 1 0 11 0 0 0 0
10 1 0 0 0 10 0 0 0 0 10 0 0 0 0 10 0 0 0 0
f =  (5,13) = B • C • D f =  (13,15) = A • B • D f =  (4,6) = A • B • D

f =  (0,8) = B • C • D
CD CD CD CD
AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10
00 0 0 1 1 00 0 0 0 0 00 0 0 1 1 00 1 0 0 1
01 0 0 1 1 01 1 0 0 1 01 0 0 0 0 01 0 0 0 0
11 0 0 0 0 11 1 0 0 1 11 0 0 0 0 11 0 0 0 0
10 0 0 0 0 10 0 0 0 0 10 0 0 1 1 10 1 0 0 1
f =  (2,3,6,7) = A • C f =  (4,6,12,14) = B • D f =  (2,3,10,11) = B • C f =  (0,2,8,10) = B • D

STANDARD CANONICAL FORM
Sum of Products (SOP):
Each term in SOP consists of product terms, where each term involves all the variables in their true or
complemented form, and these terms are combined using OR operators.
EX:- F(A,B,C) = (ABC)+(A’BC)+(A’B’C)+(AB’C)
Product of Sums (POS):

K-maps offer a visual layout where adjacent cells can be easily grouped to simplify expressions. This
visual aid makes it easier to identify patterns and quickly reduce expressions, offering a more
intuitive approach compared to abstract algebraic transformations.
EX :- F(A,B,C) = (A' + B + C).(A+B’+C).(A’+B’+C’)
CONCLUSION
Logic Representation: Represents Boolean expressions as a sum (OR) of
WHY product terms.
Efficient Circuit Design: Enables simplified circuit implementation and
reduction of gate counts for logic circuits.
Complex Expressions: Preferred for handling complex Boolean functions with

WHEN multiple variables.
Logic Minimization: When aiming for minimized circuit complexity and
optimized designs.
Grouping Minterms: Identify minterms from truth tables or Karnaugh maps

HOW and group them to form product terms.
OR Combination: Combine these product terms using logical OR operations
to form the SOP expression..
METH Karnaugh Maps: Use graphical representations to group adjacent cells for simp
ODS Boolean Algebra Laws: Apply Boolean laws like distributive, associative, and
complement laws to simplify expressions algebraically.
Thanks!
Do you have any
questions?
CREDITS: This presentation template was created by Slidesgo, and

includes icons by Flaticon, and infographics & images by Freepik

Group11 K-Map

Uploaded by

Group11 K-Map

Uploaded by

K-MAP

Unlocking the Power of Karnaugh Maps:

3. F(A,B,C) = A’.B’.C + A.B.C + A’.B.C”

What about Delay?

What about Complex?

What about Visual Representation?

What about Efficient Circuit Diagram?

SOP FORM POS FORM

f =  (0,4) = A C f =  (4,6) = A C f =  (0,2) = A C f =  (0,2,4,6) = C

f =  (5,13) = B • C • D f =  (13,15) = A • B • D f =  (4,6) = A • B • D

f =  (2,3,6,7) = A • C f =  (4,6,12,14) = B • D f =  (2,3,10,11) = B • C f =  (0,2,8,10) = B • D

Product of Sums (POS):

Complex Expressions: Preferred for handling complex Boolean functions with

Grouping Minterms: Identify minterms from truth tables or Karnaugh maps

CREDITS: This presentation template was created by Slidesgo, and

You might also like