Simplification of Expressions

Simplify the following:

A’BC + ABC’ + ABC
Use A = A + A:
= A’BC + ABC’ + ABC +ABC
Reverse distribute:
= BC(A’ + A) + AB(C’ + C)
Inverse A + A’ = 1:
= BC + AB
Commutate:
= AB + BC

2
Simplification of Expressions
Simplify the following:
A’BC + AB’C’ + A’B’C’ + AB’C + ABC
Reverse distribute:
= BC(A’ + A) + AB’(C’ + C) + A’B’C’
Inverse A + A’ = 1:
= BC + AB’ + A’B’C’
Reverse distribute:
= BC + B’(A + A’C’)
Use A +A’B = A + B:
= BC + B’(A +C’)
Distribute:
= BC + B’A + B’C’
Commutate:
= AB’ + B’C’ +BC
3
 Logic Circuit Analysis
 When a logic circuit is given, we can analyze
the circuit to obtain the logical expression
 Example:
 What is the Boolean expression for F

4
 Logic Circuit Analysis
Steps:
 Label all the outputs of the gates (modules) that are
connected directly to the inputs with (short) arbitrary
names.
 Label all the outputs of the gates that are connected
directly to the previous set.
 Repeat till all gates are done.
 Determine the expression for the output of each gate
(module) that is connected directly to the inputs in
terms of the inputs.
 Determine the expression of the next set in terms of the
expressions of the preceding one.
 Do not simplify, unless it is clear plus, till you get to the
final output(s)
5
 Logic Circuit Analysis
a T1
b T2
c
T5
T3
a
c F

c T4
d
T6
c'

F = c' + cd + ac + abc
6
 Simplify

F = c' + cd + ac + abc
= c' + d + ac(1 + b)
= c' + d + ac
= c' + ac + d
= c' + a + d
= a + c' + d
a
c' F
d

7
 Karnaugh maps
The Karnaugh map (K-map) is a tool for simplifying
combinational logic with 3 or 4 variables.
For 3 variables, 8 cells are required (23).
C
The map shown is for three variables AB 0 1
labeled A, B, and C although other
00
letters could be used. ABC ABC

Each cell represents one term. 01

ABC ABC

11 ABC ABC
Each cell differs from an adjacent cell
by only one variable. ABC ABC
10

8
The 4-Variable Karnaugh Map

9
 Karnaugh maps

Cells are usually labeled using 0’s and 1’s to

represent the variable and its complement.
C
AB 0 1

00
The numbers are entered in
Gray 01 gray code, to force adjacent
code cells to be different by only
11
one variable.
10

10
 Karnaugh maps
Alternatively, cells can be labeled with the
variable letters. This makes it simple to read,
but it takes more time preparing the map.
Example C C
C C CC
Read the terms for the yellow AB
AB ABC ABC
AB
cells.
AB ABC ABC
AB ABC
AB
Solution
AB
AB ABC ABC
The cells are ABC and
AB ABC
ABC. AB ABC ABC

11
 Karnaugh maps
K-maps can simplify combinational logic by grouping
cells and eliminating variables that change.
Example Group the 1’s on the map and read the
minimum logic.
Solution
C 0 1
AB 1. Group the 1’s into two
1
00 overlapping groups as indicated.
B
changes 01 1 1 2. Read each group by eliminating
across any variable that changes across
this 11
boundary a boundary.
10 3. The vertical group is read AC.
C changes 4. The horizontal group is read
across this
boundary AB.
X = AC +AB
12
 Karnaugh maps
Example
Group the 1’s on the map and read the minimum logic.

C changes across
outer boundary
Solution
CD
00 01 11 10 1. Group the 1’s into two separate
AB
00 1 1 groups as indicated.
B changes
2. Read each group by eliminating
01 1 1
any variable that changes
11 1 1 across a boundary.
B changes 3. The upper (yellow) group is read
10 1 1
as AD.
4. The lower (green) group is read
as AD.
C changes X = AD +AD

13
 Map the following standard SOP expression
on a Karnaugh map:
A'B'C + A'BC' + ABC' + ABC
C
0 1
Solution: For each AB
00 1 A’B’C
standard product term
in the expression, 01 1 A’BC’
place a 1 on the 3-
11 1 1 ABC
variable Karnaugh map
as shown. 10
ABC’

14
 A'BC'D' A'B'CD
A'B'C'D
Map the following standard SOP
CD
expression on a K map: 00 01 11 10
AB

A'B'CD + A'BC'D' + ABC'D + 00 1 1

ABCD + ABC'D' + A'B'C'D + 01 1
AB'CD'
11 1 1 1
A'B'CD A'BC'D' ABC'D
0011 0100 1101 ABC'D' 10 1

ABCD ABC'D' A'B'C'D

1111 110 0 0001 ABC'D
ABCD
AB'CD' AB'CD'
1 0 10

15
Mapping a Nonstandard SOP Expression
In a 4 variable domain that depends on A, B,
C, and D, if we have a product term: BC in
the SOP expression, then BC represents
-BC-, i.e.

-BC-
0110 A'BCD'
0111 A'BCD
1110 ABCD'
1111 ABCD

16
Map the following SOP expression on a K map:
A' + AB' + ABC'.

A' is: A'--, i.e. 000, 001, 010, and 011

C
AB' is AB'-, ie 100, and 101 0 1
AB
00
1 1
ABC' is 110
01
1 1
Thus the map is:
11 1

10 1 1

17
 Map the following SOP expression on a
Karnaugh map:
B’C’ + AB’ + ABC’ + AB’CD’ + A’B’C’D + AB’CD
B’C’ AB’ ABC’ AB’CD’ A’B’C’D AB’CD
0000 1000 1100 1010 0001 1011
0001 1001 1101
1000 1010
1001 1011

The resulting map:

18
Group the 1s in the K maps:

19
 Rules For Grouping
 A group must contain either 1, 2, 4, 8, or 16 cells,
which are all powers of two. In the case of a 3-
variable map, 23 = 8 cells is the maximum group.
 Each cell in a group must be adjacent to one or
more cells in that group.
 Always include the largest possible number of 1s
in a group.
 Each 1 on the map must be included in at least
one group. The 1s already in a group can be
included in another group as long as the
overlapping groups include non-common 1s.
20
Group the 1s in the K maps:

21
Group the 1s in the K maps:

22
Group the 1s in the K maps:

CD
AB 00 01 11 10
00 1 1

01 1 1 1

11 1 1 1

10 1 1 1

24
 SOP Expression Minimization
 The simplest SOP expression is an
expresion that has:
 A minimum number of ‘products’ and
 A minimum number of literal in each
‘product’.
 This can be achieved in a K-map by:
 Grouping the largest possible number of 1s
in one merger (i.e. prime implicant (PI)) and
 Selecting a minimum number of PIs
(mergers) that cover all the 1s.

25
Create the max mergers and determine the product
terms for the Karnaugh map in the following Figure
and write the resulting minimum SOP expression.

cd
00 01 11 10
ab The Corresponding PIs are:
00 1 1
b, a'c, and cd
1 1 1 1
01

1 1 1 1
11 The Minimum Sum Of
1 Products Expression is:
10
b + a'c + cd

26
Determine the product terms for the Karnaugh map in
the following Figure and write the resulting minimum
SOP expression.

C
0 1
AB
00
1 The PIs are:
01
AB, BC, and A'B'C'
1
The Minimum Sum Of
11 1 1
Products Expression is:
10 AB + BC + A'B'C'

27
Determine the product terms for the Karnaugh map in
the following Figure and write the resulting minimum
SOP expression.

yz
00 01 11 10
wx
The PIs are:
00 1 1
z', xy', and wx'y
1 1 1
01

1 1 1
11 The Minimum Sum Of
1 1 1 Products Expression is:
10
z' + xy' + wx'y

28
Determine the product terms for the Karnaugh map in
the following Figure and write the resulting minimum
SOP expression.

yz
00 01 11 10
wx
The PIs are:
00 1 1

1
w'z', xz', wy'z, and wxy'
01 1

1 1 1
11 The Minimum Sum Of
1 Products Expression is:
10
w'z' + xz' + wy'z

29
Determine the minimum SOP expression
for F:
Fa,b,c,d = ∑(2, 3, 4, 6, 7,11, 15)
cd
00 01 11 10
The PIs are:
ab
00 1 1 a'c, cd, and a'bd'
1 1 1
01
The Minimum Sum Of
1
11 Products Expression is:
1
10 F = a'c + cd + a'bd'

30
Mapping Directly from a Truth Table
C
Inputs Output 0 1

A B C F AB
0 0 0 1
00
1
0 0 1 0 01 1
0 1 0 0
0 1 1 1 11 1 1

10
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

31
 Don’t Care Cases
 Use the don’t care cases to your advantage, i.e.
set to one when it generates a better merger.
 Example:
Fa,b,c,d = ∑(2, 3, 4, 6, 7,11, 15)
and don’t care for ∑(0, 1, 5, 8,12, 14)
cd
00 01 11 10
ab
00 d d 1 1
F = a ' + cd
1 d 1 1
01

d 1 d
11

d 1
10

33
Determine the minimum SOP expressions for the
BCD to 7-Segment Generator from:
BCD 7 Segment
Decimal A B C D a b c d e f g
0: 0 0 0 0 1 1 1 0 1 1 1
1: 0 0 0 1 0 1 0 0 0 1 0
2: 0 0 1 0 1 1 0 1 1 0 1 a
3: 0 0 1 1 1 1 0 1 0 1 1
4: 0 1 0 0 0 1 1 1 0 1 0
5: 0 1 0 1 1 0 1 1 1 1 1 c b
6: 0 1 1 0 0 0 1 1 1 1 1
d
7: 0 1 1 1 1 1 0 0 0 1 0
8: 1 0 0 0 1 1 1 1 1 1 1
9: 1 0 0 1 1 1 1 1 0 1 0 e f
1 0 1 0 X X X X X X X
1 0 1 1 X X X X X X X g
1 1 0 0 X X X X X X X
NONE

1 1 0 1 X X X X X X X
1 1 1 0 X X X X X X X
1 1 1 1 X X X X X X X 34
For example generate the minimum SOP expressions
for a:
Decimal A B C D a
0: 0 0 0 0 1 CD
00 01 11 10
1: 0 0 0 1 0 AB
2: 0 0 1 0 1 00 1 1 1
3: 0 0 1 1 1
4: 0 1 0 0 0 01
1 1
5: 0 1 0 1 1
6: 0 1 1 0 0 x x x x
11
7: 0 1 1 1 1
8: 1 0 0 0 1 1 1 x x
10
9: 1 0 0 1 1
1 0 1 0 X
1 0 1 1 X
1 1 0 0 X
NONE

1 1 0 1 X a = A + B'D' + BD + CD
1 1 1 0 X
1 1 1 1 X
35
For example generate the minimum SOP expressions
for e:
BCD
Decimal A B C D e CD
00 01 11 10
0: 0 0 0 0 1 AB
1: 0 0 0 1 0 00 1 1
2: 0 0 1 0 1
3: 0 0 1 1 0 1 1
01
4: 0 1 0 0 0
5: 0 1 0 1 1 x x x x
11
6: 0 1 1 0 1
7: 0 1 1 1 0 1 x x
8: 1 0 0 0 1 10
9: 1 0 0 1 0
1 0 1 0 X
1 0 1 1 X
1 1 0 0 X e = B'D' + CD' + BC'D
NONE

1 1 0 1 X
1 1 1 0 X
1 1 1 1 X 36