Scribd
Upload
20 views

SimplificationusingK Maps

The document discusses simplifying boolean functions using Karnaugh maps. It explains how to represent functions in K-maps and simplify two and three variable boolean functions using K-maps. Examples are provided to demonstrate simplifying two and three variable functions.

Uploaded by

hmanupati08
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

SimplificationusingK Maps

The document discusses simplifying boolean functions using Karnaugh maps. It explains how to represent functions in K-maps and simplify two and three variable boolean functions using K-maps. Examples are provided to demonstrate simplifying two and three variable functions.

Uploaded by

hmanupati08
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Simplification using K-

maps:
Lecture 8
Jeevan Battini
Lecture Learning Outcomes (LLOs):
• After Completion of the session, the students will be able to…

LLO1: Represent functions in K-map.


LLO2: simplify two variable boolean functions using K-maps.
LLO3: simplify three variable boolean functions using K-maps.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 2


MINIMIZATION USING KARNAUGH MAP (K-MAP) METHOD

• The K-map is a diagram made up of squares. Each square represents one


minterm.
• Since any function can be expressed as a sum of minterms, it follows that a
Boolean function can be recognized from a map by the area enclosed by
those squares. Whose minterms are included in the operation.
• By various patterns, we can derive alternative algebraic expression for the
same operation, from which we can select the simplest one. (One that has
minimum member of literals).

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 3


Two and Three Variable K Map:

• Two variable K-map:

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 4


Example (two variable K-map)
• Now let us map a Boolean function Y = A + B.
• Draw the truth table of given function.

• Draw a two variable K map an fill those squares with a 1 for which the
value of minterm in the function is equal to 1.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 5


Three variable K-map
• Now examine a three variable truth table

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 6


Boolean Expression Minimization Using K-Map
1. Construct the K-map as discussed. Enter 1 in those squares
corresponding to the minterms for which function value is 1.
Leave empty the remaining squares. Now in following steps the
square means the square with a value 1.
2. Examine the map for squares that can not be combined with any
other squares and form group of such single squares.
3. Now, look for squares which are adjacent to only one other
square and form groups containing only two squares and which
are not part of any group of 4 or 8 squares. A group of two
squares is called a pair.
7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 7
Continued..
4. Next, group the squares which result in groups of 4 squares but
are not part of an 8-squares group. A group of 4 squares is called
a quad.
5. Group the squares which result in groups of 8 squares. A group of
8 squares is called octet.
6. Form more pairs, quads and outlets to include those squares that
have not yet been grouped, and use only a minimum no. of
groups. There can be overlapping of groups if they include
common squares.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 8


Continued…
7. Omit any redundant group.
8. Form the logical sum of all the terms generated by each group.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 9


Using Logic Adjacency Theorem
• a group of two squares eliminates one variable,
• a group of four squares eliminates two variable
• a group of eight squares eliminates three variables.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 10


Simplifying two variable function
• ---

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 11


Simplifying two variable function
• --

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 12


Simplifying two variable function
• --

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 13


Simplifying 3-variable Boolean function
• --

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 14


Simplifying 3-variable Boolean function
•-

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 15


Simplifying 3-variable Boolean function
•-

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 16


Example 2:
•-

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 17


Outcomes revisited
• After Completion of the session, the students will be able to…

LLO1: Represent functions in K-map.


LLO2: simplify two variable boolean functions using K-maps.
LLO3: simplify three variable boolean functions using K-maps.

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 18


Next Session:
• Simplification using K-maps
• New concepts

THANK YOU ….Students

7/12/2023 U18EI309: Digital Electronics (CSE-1) - Jeevan Battini 19

You might also like