2023 S1 IT1020 Lecture 05
2023 S1 IT1020 Lecture 05
2023 S1 IT1020 Lecture 05
6
SIMPLIFIED DIGITAL LOGIC CIRCUITS
SIMPLIFICATION OF THE DIGITAL LOGIC CIRCUITS
Why do we need simplification?
To reduce the number of gates required to build the circuit
and hence:
Reduce the cost
Reduce the power consumption
Reduce the space required
Reduce the propagation delay
SIMPLIFICATION OF THE DIGITAL LOGIC CIRCUITS
Methods to Simplify the Digital Logic Circuits
Using Truth Table
Using Mathematical Method
14
DESCRIPTION OF K-MAPS AND TERMINOLOGY
For example, the minterms for a function having the
inputs x and y are:
Consider the Boolean function,
Its minterms are:
15
DESCRIPTION OF K-MAPS AND TERMINOLOGY
Similarly, a function
having three inputs, has
the minterms that are
shown in this diagram.
23 =8 miniterms
16
DESCRIPTION OF K-MAPS AND TERMINOLOGY
A Kmap has a cell for each
minterm.
This means that it has a cell for
each line for the truth table of a
function.
The truth table for the function
F(x,y) = xy is shown at the right
along with its corresponding
Kmap.
17
DESCRIPTION OF K-MAPS AND
TERMINOLOGY
As another example, we give the truth
table and KMap for the function, F(x,y) =
x + y at the right.
This function is equivalent to the OR of all
of the minterms that have a value of 1.
Thus:
18
K-MAP SIMPLIFICATION FOR TWO VARIABLES
Of course, the minterm function that we derived from our Kmap was not in
simplest terms.
That’s what we started with in this example.
20
EXAMPLE -1
Groups Powers of 2
25
K-MAPS – RULES
Groups Power of 2
26
K-MAPS – RULES
Groups may
overlap
28
K-MAPS – RULES
32
K-MAP SIMPLIFICATION FOR THREE VARIABLES
Thus, the first row of the Kmap contains all minterms where x has
a value of zero.
The first column contains all minterms where y and z both have a
value of zero.
33
K-MAP SIMPLIFICATION FOR THREE VARIABLES
34
K-MAP SIMPLIFICATION FOR THREE VARIABLES
reduces to F(x) = z.
You could verify
this reduction
with identities or
a truth table.
35
K-MAP SIMPLIFICATION FOR THREE VARIABLES
Now for a more complicated Kmap. Consider the
function:
36
K-MAP SIMPLIFICATION FOR THREE VARIABLES
In this Kmap, we see an example of a group that wraps
around the sides of a Kmap.
This group tells us that the values of x and y are not
relevant to the term of the function that is encompassed
by the group.
What does this tell us about this term of the function?
39
K-MAP SIMPLIFICATION FOR FOUR VARIABLES
We have populated the Kmap shown below with the nonzero
minterms from the function:
Recall that
groups can
overlap.
40
K-MAP SIMPLIFICATION FOR FOUR VARIABLES
Our three groups consist of:
A purple group entirely within the Kmap at the right.
A pink group that wraps the top and bottom.
A green group that spans the corners.
Thus we have three terms in our final function:
41
K-MAP SIMPLIFICATION FOR FOUR VARIABLES
It is possible to have a choice as to how to pick groups within a Kmap,
while keeping the groups as large as possible.
The (different) functions that result from the groupings below are logically
equivalent.
42
DON’T CARE CONDITIONS
43
DON’T CARE CONDITIONS
In one grouping in the Kmap below, we have the function:
44
DON’T CARE CONDITIONS
45
DON’T CARE CONDITIONS
The truth table of:
46
THANK YOU
47