Chapter Four Solutions

We will solve problems 1, 2, and 3 for each of the functions.

1. a.
A 001 √ F 0-1 (A + C) L -1- (G+K, H+J)
B 0 1 0√ G 0 1 -√ (B + D)
-------------- H - 1 0√ (B + D)
C 0 1 1√ --------------
D 1 1 0√ J - 1 1√ (C + E)
-------------- K 1 1 -√ (D + E)
E 1 1 1√
The only two prime implicants are F (a' c) and L (b).

2. A 001
B 010
C 011
D 110
E 111
----------
B ¢ A undefined
F 01- C ¢ B ≥ C, B
D ¢ A undefined
G 11- E ¢ D ≥ E, D
H 0-1 F¢A≥A
At this point, all that is left is F, G, and H
J -1- G ¢ F ≥ G, F
J ¢ H undefined
The only two prime implicants are H (a' c) and J (b).
3. The prime implicant table has the following format: (Since the two methods
produce different labels for prime implicants, we will label them alphabetically for
problems 3 and 6)
√ √ √ √ √
1 2 3 6 7
A 0-1 X X
B -1- X X X X

f = a' c + b

1. b.
A 0 0 0√ F 00- (A + B)
-------------- --------------
B 0 0 1√ G -01 (B + C)
-------------- --------------
C 1 0 1√ H 1-1 (C + E)
D 1 1 0√ J 11- (D + E)
--------------
E 1 1 1√

The prime implicants are w' x', x' y, w y, and w x

2. We first map the function

wx
00 01 11 10
y
0 1 1

1 1 1 1

A 00-
B 11-
C 1-1
B ¢ A, C ¢ B undefined
D -01 C¢A
D ¢ C, D ¢ A undefined, D ¢ B = C
3. b. The prime implicant table is

√ √ √ √
0 1 5 6 7
00-* A X X
-01 B X X
1-1 C X X
11-* D X X

A and D are essential; either B or C can be used to cover m5.

f = w' x' + w x + {x' y or w y}

1. c.
A O O 1 0√ L 0 0 1 - A+C√ AA 0 - 1 - L+T,M+R
B 1 0 0 0√ M 0 - 1 0 A+D√ AB - 0 1 - L+V,N+S
---------------- N - 0 1 0 A+E√ --------
C 0 0 1 1√ P 1 0 - 0 B+E AC - - 1 1 R+X,S+W
D 0 1 1 0√ Q 1 - 0 0 B+F
E 1 0 1 0√ ----------------
F 1 1 0 0√ R 0 - 1 1 C+G√
---------------- S - 0 1 1 C+H√
G 0 1 1 1√ T 0 1 1 - D+G√
H 1 0 1 1√ U 1 0 1 - E+H√
J 1 1 0 1√ V 1 1 0 - F+J
---------------- ----------------
K 1111 W - 1 1 1 G+K√
X 1 - 1 1 H+K√
Y 1 1 - 1 J+K
2. Start by mapping the function and circling enough terms to cover the function,
mostly prime implicants.
wx
00 01 11 10
yz
00 1 1

01 1

11 1 1 1 1

10 1 1 1

A 0-1-
B --11
C 101-
D 1-00
E 110-
B¢A, C¢B undefined
F - 0 1 - C¢A > C
D¢B, D¢A, E¢D undefined
G 1 1 - 1 E¢B
E¢A, F¢E undefiend
H 1 0 - 0 F¢D no additional new terms

3. c.
√ √ √ √
2 3 6 7 8 10 11 12 13 15
A 0-1- X X X X
B 110- X X
C --11 X X X X
D 10-1 X X
E 11-1 X X
F 1-00 X X
G -01- X X X X

Reducing the table

8 10 11 12 13 15
B 110- 4 X X
C --11 3 X X
D 10-1 4 X X
 E 11-1 4 X X
F 1-00 4 X X
G -01- 3 X X

Since C and G use lower cost gates, we should try to use one or both of them. Since
there are six 1's, and each term covers two of them, we need three more terms.
Choosing C, we can cover the function with B and D. Choosing G, we can cover it with
F and E. Thus, the two solutions are

f = w' y + y z + w x y' + w x' z'

f = w' y + x' y + w y' z' + w x z

3. d. (For problem d, we will only show the prime implicant table.)

√ √ √ √ √ √ √ √
0 2 3 4 5 8 11 12 13 14 15
A --00* X X X X
B -10-* X X X X
C 11--* X X X X
D 00-0 X X
E 001- X X
F 1-1 1 X X
G -011 X X

The terms included in all solutions are

f = r' s' + q r' + p q +

Reducing the table, we have

2 3 11
D 00-0 X
E 001- X X
F 1-1 1 X
G -011 X X

The three solutions are

D + G = p' q' s' + q' r s
E + F = p' q' r + p r s
E + G = p' q' r + q' r s
1. e. All 1's and don't cares are included.

A O O 1 0√ M 0 - 1 0 A+C√ AD - - 10 M+W,N+S
---------------- N - 0 1 0 A+E√ --------
B 0 1 0 1√ ---------------- AE -1-1 P+AB,Q+Z
C 0 1 1 0√ P 0 1 - 1 B+E√ AC -11- P+AC,S+Z
D 1 0 0 1√ Q - 1 0 1 B+J√ AD 1--1 T+AB,V+AA
E 1 0 1 0√ R 0 1 1 - C+G√ AE 1-1- V+AC,W+AA
F 1100 S - 1 1 0 C+K√ AF 11-- X+AC,Y+AB
---------------- T 1 0 - 1 D+M√
G 0 1 1 1√ U 1 - 0 1 D+J√
H 1 0 1 1√ V 1 0 1 - E+H√
J 1 1 0 1√ W 1 - 1 0 E+K√
K 1 1 1 0√ X 1 1 0 - F+J√
---------------- Y 1 1 - 0 F+K√
L 1 1 1 1√ ----------------
Z - 1 1 1 G+L√
AA 1 - 1 1 H+L√
AB 1 1 - 1 J+L√
AC 1 1 1 - K+L√

The prime implicants are

c d', b d, b c, a d, a c, a b

Mapping the function, we can list all of the prime implicants. To make sure, we can see
that consensus does not form any new terms.

ab
00 01 11 10
cd
00 1

01 1 1 1

11 1 1 1

10 1 1 1 1
ab c d' bd ad bc ac

3. e. Only the 1's are used in the prime implicant table

√ √ √ √ √
5 7 9 11 13 14
A 11-- X X
B --10 X
 C -1-1* X X X
D 1--1* X X X
E -11- X X
F 1-1- X X

After choosing the two essential prime implicants, the table reduces to

14
A 11-- X
B --10 X
E -11- X
F 1-1- X

Any of the remaining prime implicants can be used, producing four solutions

f = b d + a d + {a b or c d' or b c or a c}
3. f. (For problem f, we will only show the prime implicant table.)

√ √ √ √ √ √ √
0 2 4 5 6 7 8 9 10 14
A 0 1 - -* X X X X
B -0-0 X X X X
C --10* X X X X
D 0-1- X X X
E 0--0 X X X X
F 1-0 1 X
G -101 X
H 100- X X

C is essential. Since G is dominated by A and costs more, we can eliminate G and use A,
producing

0 8 9
B -0-0 X X
E 0--0 X
F 1-0 1 X
H 100- X X

Row D was eliminated also, since it had no X's. Using Petrick's method, we get

(B + E) (B + H) (F + H) = (B + E H) (F + H) =
= B F + B H + E F H + EH

Since E F H is more terms, there are three equally good solutions,

f = a' b + c d' + b' d' + a c' d

f = a' b + c d' + b' d' + a b' c'
f = a' b + c d' + a' d' + a b' c'
1. g.
0 0 0 0 0√ 0 0 0 0 -√ 00-0-
------------ 0 0 - 0 0√ 0-00-
0 0 0 0 1√ 0 - 0 0 0√ -0-00
0 0 1 0 0√ - 0 0 0 0√ --000
0 1 0 0 0√ ----------- -----------
1 0 0 0 0√ 0 0 - 0 1√ -10-0
------------ 0 - 0 0 1√ 1-0-0
0 0 1 0 1√ 0 0 1 0 -√ 1--00
0 1 0 0 1√ - 0 1 0 0√
0 1 0 1 0√ 0 1 0 0 -√
1 0 0 1 0√ 0 1 0 - 0√
1 0 1 0 0√ - 1 0 0 0√
1 1 0 0 0√ 1 0 0 - 0√
------------ 1 0 - 0 0√
1 0 0 1 1√ 1 - 0 0 0√
1 1 0 1 0√ -----------
1 1 1 0 0√ - 1 0 1 0√
------------ 1001-
0 1 1 1 1√ 1 - 0 1 0√
------------ 1 - 1 0 0√
1 1 1 1 1√ 1 1 0 - 0√
1 1 - 0 0√
-----------
-1111

2. g. Mapping the function

V
WX 0 WX 1
00 01 11 10 00 01 11 10
YZ YZ
00 1 1 1 00 1 1 1 1

01 1 1 1 01

11 1 11 1 1

10 1 10 1 1

A 00-0-
B 0100-
C -10-0
D -1111
E 1--00
 F 1001-
Just showing new terms
G 0-00- B¢A > B
H -0-00 E¢A < G
J 100-0 H¢F
K --000 G¢E
L 1-0-0 J¢C > J

3. g. The table is not shown; only essential prime implicants are used.

G = V W' X' Y + W X Y Z + V' X' Y' + W X' Z' + V Y' Z' + W' X' Z'

1, 2, 3. h. Answer in book; the solution is straightforward.

4. a.
A 0 0 0 1 0 -√ 0 0 - 1 0 - K=A+C>A,C 1-0- -0 V
B 1 0 0 0 - -√ 0 - 0 1 0 - L=A+D V=N+T,Q+S
-------------- - 0 0 1 0 - M=A+E
C 0 0 1 1 0 -√ 1 0 0 - - - N=B+E>B,E
D 0101 -- 1 0 - 0 0 - P=B+F>F
E 1 0 0 1 - -√ 1 - 0 0 - 0√Q=B+G>G
F 1 0 1 0 0 -√ -------------
G 1 1 0 0 - 0√ - 1 0 1 - 0 R=D+H>H
--------------- 1 - 0 1 - 0√S=E+H
H 1 1 0 1 - 0√ 1 1 0 - - 0√T=G+H
J 1 1 1 0 - 0√ 1 1 - 0 - 0 U=G+J>J

Thus, the shared terms are a' b c' d and a b' c'. The prime implicants of f are
b c' d, a b d', and a c'. The prime implicants of g are a' b' d. a' c' d, b' c' d, and a b' d'.
5. a. We will start this with minterms, and then show only the new terms that are
formed
A 0001 0-
B 0011 0-
C 0101 --
D 1000 --
E 1001 --
F 1010 0-
G 1100 -0
H 1101 -0
J 1110 -0
K 00-1 0- B¢A > B, A
L 100- -- E¢D > E, D
M 110- -0 H¢G > H, G
N 0 - 0 1 0 - K¢C
P -001 0- L¢K
Q 10-0 0- L¢F > F
R 1-0- -0 M¢L >M
S 11-0 -0 R¢J > J
T 1-00 -0 S¢L
The terms are the same as for 4. A.

f g
√ √ √ √ √ √
$ 5 8 9 12 13 14 1 3 5 8 9 10
0101 A 5 X X
100- B 4 X X X X
-101 C 4 X X
11-0* D 4 X X
1-0- E 3 X X X X
00-1* F 4 X X
0-01 G 4 X X
-001 H 4 X X
10-0* J 4 X X

We can now reduce the table to

f g

$ 5 8 9 13 5 9
0101 A 5 X X
100- B 4 X X X
-101 C 4 X X
 1-0- E 3 X X X
0-01 G 4 X
-001 H 4 X
The obvious solution is to use E for f, share A with both f and g, and then use either B or H
to finish g. That would require three gates for this part at a cost of 3 (E), 6 (A used both
places ) and 4 (B or H), totalling 13. Another approach would be to share B (5) and then
use C (4) for f, and G (4) for g, also totaling 13. Thus, the three solutions are
f = a b d' + a b' c' + a' b c' d
g = a' b' d + a b' d' + a' b c' d + {a b' c' or b' c' d}

f = a b d' + a c' + b c' d

g = a' b' d + a b' d' + a b' c' + a' c' d

4. b.
A 0 0 0 0 0 -√ 0 0 0 - 0 - N=A+B>A --00 0-
-------------- 0 - 0 0 0 - P=A+C>C√ P+V>P;Q+T>Q,T
B 0001 -- - 0 0 0 0 - Q=A+D√ -------------
C 0 1 0 0 0 -√ -------------- 1--0 -0
D 1 0 0 0 - -√ 0 - 0 1 - 0 R=B+E>E U+AA>U,AA;V+Z>Z
-------------- 0 1 - 0 0 - S=C+F>F --------------
E 0 1 0 1 - 0√ - 1 0 0 0 - T=C+H√ 1-1- -0
F 0 1 1 0 0 -√ 1 0 - 0 - 0 U=D+G>G Y+AB>Y,AB;Z+AC>AC
G 1 0 1 0 - 0√ 1-00 -- V=D+H>D,H
H 1 1 0 0 - -√ -------------
--------------- 0 1 - 1 - 0 W=E+J
J 0111 -- Q 1 1 - 0 - X=F+J
K 1 0 1 1 - 0√ 1 0 1 - - 0 Y=G+K>K√
L 1 1 1 0 - 0√ 1 - 1 0 - 0 Z=G+L>L√
--------------- 1 1 - 0 - 0 AA=H+L√
M 1 1 1 1 - 0√ -------------
- 1 1 1 - 0 AB=J+M>M
1 - 1 1 - 0 AC=K+M√
1 1 1 - - 0 L+M√

The shared terms are W' X' Y' Z, W' X Y Z, and W Y' Z'. The other terms for F are W' Y'
Z, W' X Z, X Y Z, W Z', and W Y. The terms for G are W' X' Y',
W' X Z', W' X Y, and Y'Z'.

5. b. We will map F, G, and the product F G.

 WX WX WX
00 01 11 10 YZ 00 01 11 10 00 01 11 10
YZ YZ
00 1 1 00 1 1 1 1 00 1 1

01 1 1 01 1 01 1

11 1 1 1 11 1 11 1

10 1 1 10 1 10
F G FG

The prime implicants of the product are W' X' Y' Z, W' X Y Z, and W Y' Z'. The prime
implicants of F are W' Y' Z, W' X Z, X Y Z, W Z', and W Y. Those for G are W' X' Y',
W' X Z', W' X Y, and Y' Z'. E could try conmsensus among these terms, but will find no
additional terms.

6. b. f g
√ √ √ √
$ 1 5 7 8 10 11 12 14 15 0 1 4 6 7 8 12
0001 A 5 X X
0111 B 5 X X
1-00 C 4 X X X X
0-01 D 4 X X
O1-1 E 4 X X
-111 F 4 X X
1--0 G 3 X X X X
1-1-* H 3 X X X X
000- J 4 X X
01-0 K 4 X X
011- L 4 X X
--00 M 3 X X X X

f g
√ √ √ √ √ √
$ 1 5 7 8 12 0 1 4 6 7 8 12
0001 A 5 X X
0111 B 5 X X
1-00 C 4 X X X X
0-01 D 4 X X
O1-1 E 4 X X
-111 F 4 X
1--0* G 3 X X
000- J 4 X X
01-0 K 4 X X
 011- L 4 X X
--00* M 3 X X X X

If we choose M for g, then we will use G for f (costs less than C), leaving

f g
$ 1 5 7 1 6 7
0001 A 5 X X
0111 B 5 X X
0-01 D 4 X X
O1-1 E 4 X X
-111 F 4 X
000- J 4 X
01-0 K 4 X
011- L 4 X X

To cover g with two more terms, we must use L. Then, we could use A for both f and g,
and E for f, producing

f = W Y + W Z' + W' X' Y' Z + W' X Z

g = Y' Z' + W' X Y W' X' Y' Z
This requires 8 gates with 23 inputs.

If we don't use M, then C is used for both f and g, and J and K are required for g.

f √ √ √ √ √ √ g √ √
$ 1 5 7 8 12 0 1 4 6 7 8 12
0001 A 5 X X
0111 B 5 X X
1-00* C 4 X X X X
0-01 D 4 X X
O1-1 E 4 X X
-111 F 4 X
1--0 G 3 X X
000- J 4 X X
01-0 K 4 X X
011- L 4 X X

That reduces the table to

f g
$ 1 5 7 7
0001 A 5 X
0111 B 5 X X
 0-01 D 4 X X
O1-1 E 4 X X
-111 F 4 X
011- L 4 X

Now, we use B for both f and g, and D for f, leaving

F = W Y + W Y' Z' + W' X Y Z + W' Y' Z

G = W Y' Z' + W' X' Y' + W' X Z' + W' X Y Z

This still requires 8 gates, but 26 inputs.

4. c.
0 0 0 0 0 - 0√ 0 0 - 0 0 - 0√ 0--0 0-0
----------------- 0 - 0 0 0 - 0√ -0-0 0-0
0 0 0 1 - 0 -√ - 0 0 0 0 - 0√ --00 0-0
0 0 1 0 0 - -√ ---------------- ----------------
0 1 0 0 0 - 0√ 0 0 - 1 - 0 -√ 0--1 -0-
1 0 0 0 - - 0√ 0 - 0 1 - 0 -√ ----------------
----------------- -001 -00 -1-1 00-
0 0 1 1 - 0 -√ 001- 00- 11-- 00-
0101 --- 0 - 1 0 0 - 0√
0 1 1 0 0 - 0√ -010 0--
1 0 0 1 - 0 0√ 010- 0-0
1010 --- 0 1 - 0 0 - 0√
1 1 0 0 0- - - - 1 0 0 0 - 0√
----------------- 100- -00
0 1 1 1 - 0 -√ 10-0 --0
1 0 1 1 0 - 0√ 1 - 0 0 0 - 0√
1 1 0 1 0 0 -√ ----------------
1 1 1 0 0 0 -√ 0 - 1 1 - 0 -√
----------------- 0 1 - 1 - 0 -√
1 1 1 1 0 0 -√ - 1 0 1 0 0 -√
101- 0-0
1-10 00-
1 1 0 - 0 0 -√
11-0 00-
----------------
- 1 1 1 0 0 -√
1 1 - 1 0 0 -√
1 1 1 - 0 0 -√
Terms for all three: a' b c' d, a b' c d'
Terms for f and g: a b' d'
Terms for f and h: a' d
Terms for g and h: b' c d', a b c' d'
Terms for only f: b' c' d, a b' c'
Terms for only g: a' b c', a b' c, a' d', b' d', c' d'
Terms for only h: a' b' c, a c d', a b d', b d, a b
5. c. By mapping the functions and each of the products, we can find the terms
that we found in 4. c. (We could also start with minterms as we did in 5. a.)
The table reduces to

f g h
8 9 10 5 8 12 2 10 12 13 14 15
0101 A 5 X
1010 B 5 X X
1100 C 5 X X
-001 D 4 X

001- E 4 X
-010 F 4 X X
O1O- G 4 X
100- H 4 X X
10-0 J 4 X X X
1-10 L 4 X X
-0-0 N 3 X
--00 P 3 X X
-1-1 R 3 X X
11-- S 3 X X X X

To cover h, we need F and S; any other solution would require more gates. For g, we use
G (rather than the more expensive A) and can complete the cover with P. Finally, f uses J
(rather than the more expensive B) and either D or H. That results in the following
equations

f = a' d + a b' d' + {b' c' d or a b' c'}

g = a b' c + a' d' + a' b c' + c' d'
h = a' d + b' c d' + a b
4. d. We will omit the work; the terms are the same as found in 5.d.

5. d We will first plot the products, f g, f h, g h, and f g h. The prime implicants

of these are the candidates for sharing. We will then construct the prime implicant table,
including all of these, as well as prime implicants of the individual functions that are not
already included.

ab ab
00 01 11 10 00 01 11 10
cd cd
00 1 00 1

01 1 1 01 1 1

11 1 1 11 1 1

10 10

fg fh

ab ab
00 01 11 10 00 01 11 10
cd cd
00 00

01 1 1 1 01 1 1

11 1 1 11 1 1

10 1 1 10

gh fgh

We start with, b d, the prime implicant of all three. Next we find a b' c' d', the other prime
implicant of f g. The prime implicant of f h is a' b c', and those of g and h are a' c' d and a
c d'.
 The complete prime implicant table is shown next.Essential prime implicants cover
all of f. Reducing the table, we get

g h
$ 1 8 9 10 11 14 14
B 1000 5 X
C 010- 1
D 0-01 1 X
E 1-10 4 X X X
F 111- 4 X X
K --01 3 X X
L 10-- 3 X X X X
M 1--1 3 X X
N 1-1- 3 X X X

where the cost of rows C and D have been reduced to 1, since the AND gate is already
implemented. Row B can be eliminated since it is dominated by L and costs more. Thus,
L must be used for g. Either E or F must be used for h, and also for g since m10 has
already been covered by L. That leaves D as the final term for g, since it costs less than
K.

The final solution is

f = A + G + J = b d + c' d' + a' c d

g = A + L + D + {E or F}
= b d + a b' + a' c' d + {a c d' or a b c}
h = A + C + D + P + {E or F}
= b d + a' b c' + a' c' d + b' c d' + {a c d' or a b c}