Scribd
Upload
44 views44 pages

Chapter 5-Karnaugh Map (K-Map)

Uploaded by

dynzhaa
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
44 views44 pages

Chapter 5-Karnaugh Map (K-Map)

Uploaded by

dynzhaa
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/ 44

ITT270 Digital Electronics

Chapter 5
Karnaugh Map (K-Map)
Outline
❑ Karnaugh Map
❑ Simplification of 2 variables using Karnaugh Map
❑ Simplification of 3 variables using Karnaugh Map
❑ Simplification of 4 variables using Karnaugh Map
❑ Simplification of Boolean equation using Karnaugh
Map
❑ Combinational Circuit Design
❑ Expression X in Karnaugh Map
Karnaugh Maps (K-Map)
❑ One of the easiest ways to simplify a
Boolean expressions
❑ A graphical representation of the output of a
given Boolean expression.
❑ Contains the same information as a truth
table.
❑ Its practical usefulness is limited to 6
variables.
❑ Our discussion to problems up to 4
variables only.
…K-Map
❑ The K-Map contains a cell for each input
combination.
❑ A Boolean expression or a truth table with
n input variables has 2n cells on the
K-Map.
❑ A 2 variable K-Map has 22 = 4 cells.
…K-Map
❑ The K-Map cells are labelled, so that
horizontally adjacent cells differ only in
one variable.
❑ For example, cell (0) and cell (2):
differ only in one variable, A.
❑ Similarly, vertically adjacent cells differ
only in one variable.
❑ For example, cell (0) and cell (1):
differ only in one variable, B.
…K-Map
❑ A Boolean expression or truth table with 3
variables has 23 = 8 cells on the K-Map.
…K-Map
❑ 4 variable K-Map
Simplification Using
2 Variable K-Map
❑ The steps in simplifying a Boolean expression
using a K-Map:
1. Write a sum of product expression from the truth
table.
2. Plot a 1 on the K-Map for each product term, or
plot a 1 on the K-Map for each output Y = 1
3. Draw loops around adjacent cells containing two
1’s on the K-Map. The loops may overlap.
4. Repeat step 2 and 3.
5. Each loop produces a simplified product term.
6. Logically OR the simplified product term.
Example 1
❑ Simplify the OR gate truth table using
K-Map.
Solution
1. The Boolean expression in the form of sum of
product is , which can also be
written as Σ=(1,2,3). So plot 1 on the K-Map (cell
1, 2 and 3).
2. Loop the adjacent cells. There are 2 pairs of 1’s
that can be loop: cell (1 3) and cell (2 3). Each
loop contains two 1’s.
3. Each loop produces a simplified product term. The
loop for cell (1 3) produces a product term B. This
can easily be proven using Boolean algebra:
…Solution
❑ The loop for cell (2 3) produces a product
term A, that can proven using Boolean
algebra:

4. Logically OR the simplified product term.


The simplified Boolean expression is
Y = A + B.
Example 2
❑ Simplify the NAND gate truth table using
K-Map.
Example 3

❑ Simplify the XOR gate truth table using K-Map.


Solution
❑ Cell 1 is not considered adjacent to cell 2,
because both variables are different.
Therefore it is not possible to form a loop.
❑ We cannot simplify the expression.
❑ So the expression is
Simplification Using 3 Variable
K-Map
❑ A 3 variable K-Map allows loop containing two,
four and eight 1’s.

1. First, draw loop around adjacent cells containing


four 1s. A loop containing many 1’s will produce a
simpler product term. So, find out if there are
other possible loops containing four 1’s. The
loops may overlap.

2. After finishing loops containing four 1’s, draw


loops containing two 1’s.
Example 1
❑ Write the simplified expression from
the truth table shown below.
Solution
Example 2
❑ Write the simplified expression from the
truth table shown below.
Solution
Example 3
❑ Write the simplified expression from the
truth table shown below.
Solution
Example 4
❑ The cell (0 4) on the K-map shown below can
be connected forming a cylinder. The loop for
cell (0 1) produces
…
❑ The cells (0 1) and cell (1 4) will form a loop
containing four 1’s produces the term
Simplification Using 4 Variable
K-Map
❑ A 4 variable K-Map allows loop containing
two, four, eight and sixteen 1’s.

1. First, draw loop around adjacent cells


containing eight 1s. A loop containing many 1’s
will produce a simpler product term. So, find out
if there are other possible loops containing
eight 1’s. The loops may overlap.
2. After finishing loops containing eight 1’s,
draw loops containing four 1’s. Next draw loops
containing two 1’s.
Example 1
❑ Write the simplified expression from the truth
table shown below.
Solution
Example 2
❑ Write the simplified Boolean expression from
the K-Map as shown below.
Example 3
❑ Write the simplified expression from the
K-Map shown below.
…Example 3
Simplifying Boolean Expression
Using Karnaugh Maps

❑ Simplifying Boolean expression using K-Map


is much easier and will usually produce a
simplified expression compared to using
Boolean algebra.

❑ Given a sum of product expression, we can


map each product term on the K-Map.
Example 1

❑ Simplify the Boolean expression


using K-Map.
Example 2

❑ Simplify the expression using K –Map

❑ First, we expand the expression in the form of


Sum of Product:
Solution
…
❑ Looping the K-Map will produce a simplified
expression
Combinational Circuit
Design-Example
❑ Will use Karnaugh Map to simplify the expression.
❑ The diagram shown below is a system to control three
valves: Pwater, Px and Py that will control the flow of water,
liquid X and liquid Y into a tank. During the initial state, the
tank is empty. When the system starts, valve Pwater is
open to allow the flow of water. As the water level
reaches level A, the next valve Px is open to allow the
flow of liquid X into the tank. When the mixture of water +
liquid X reaches level B, valve Py is open to allow the
flow of liquid Y. When it reaches level C, all valves are
closed and a green light is switch on signaling a
successful operation.
…

❑ The tank uses three float switches A, B and C. If


any of the switches fail to function, all valves are
closed and a red light is switch on.
Truth Table
Simplify the expression using
K-Map
Logic Circuit
Expression X In Karnaugh Map

❑ Some logic circuits may be designed so that


certain input conditions have no specific
output levels, usually because these input
conditions will never occur.
❑ In other words, there will be certain
combinations of input, where we ‘don’t care’
whether the output is 1 or 0.
Example
❑ Let us consider a logic circuit that will detect an
odd number from a BCD code. BCD code are
numbers from 0 to 9. So in this circuit, there six
input numbers that are not used: 1010, 1011,
1100, 1101, 1110 and 1111.
Truth Table

❑ The truth table is as


follows. There are six
don’t care terms
which is labelled as
X.
Karnaugh Map

You might also like