EE/COSC 2390 Homework Set 4 Solutions Spring 2004

3-2 Simplifying the following Boolean functions, using three-variable maps:

(a) F(x, y, z) =

(0, 1, 5, 7)
00 01 11 10
0
1
F
x
yz
1 1
1
1
_
`

_
`

The reduced SOP expression is F(x, y, z) = x

+xz
(b) F(x, y, z) =

(1, 2, 3, 6, 7)
00 01 11 10
0
1
F
x
yz
1
1
1 1
1
_

_
`

The reduced SOP expression is F(x, y, z) = y +x

z
3-3 Simplifying the following Boolean functions, using four-variable maps:
(a) xy +x

+x

yz

00 01 11 10
0
1
x
yz
1 1
1
1
_
`

_
`

The reduced SOP expression is x

+xy
1
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(b) x

+yz +x

yz

00 01 11 10
0
1
x
yz
1 1 1
1
1
_
`

_
`

The reduced SOP expression is x

+yz
(c) A

B +BC

+B

00 01 11 10
0
1
A
BC
1 1
1
1
1
_
`

The reduced SOP expression is A

B +C

3-5 Simplifying the following Boolean functions, using four-variable maps:

(a) F(w, x, y, z) =

(1, 4, 5, 6, 12, 14, 15)

00 01 11 10
00
01
11
10
F
wx
yz
1
1 1 1
1 1 1
_

_
`

_
`

The reduced SOP expression is F(w, x, y, z) = w

z +wxy +xz

2
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(b) F(A, B, C, D) =

(0, 1, 2, 4, 5, 7, 11, 15)

00 01 11 10
00
01
11
10
F
AB
CD
1 1 1
1 1 1
1
1
_

_
`

_
`

The reduce SOP expression is F(A, B, C, D) = A

+A

+A

BD+ACD where the term A

BD
could be replaced by BCD if desired.
(c) F(w, x, y, z) =

(2, 3, 10, 11, 12, 13, 14, 15)

00 01 11 10
00
01
11
10
F
wx
yz
1 1
1 1
1 1 1 1
_
`

_
The reduced SOP expression is F(w, x, y, z) = wx +x

y
3
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(d) F(A, B, C, D) =

(0, 2, 4, 5, 6, 7, 8, 10, 13, 15)

00 01 11 10
00
01
11
10
F
AB
CD
1 1
1 1 1 1
1 1
1 1
_

_
`

The reduced SOP expression is F(A, B, C, D) = B

+ BD + A

B where the term A

B could be
replaced with A

if desired.
3-6 Simplifying the following Boolean expressions, using four-variable maps:
(a) A

+AC

+B

CD

+A

BCD+BC

D
00 01 11 10
00
01
11
10
AB
CD
1
1
1
1
1
1 1
1
_
`

_
`

_

The reduce SOP expression is B

+ABC

+A

BD
4
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(b) x

z + w

xy

+w(x

y +xy

)
00 01 11 10
00
01
11
10
wx
yz
1 1
1 1
1 1
1
1 1
_

_

_
`

The reduced SOP expression is xy

+x

z +wx

y
3-12 Simplifying the following Boolean functions in product of sums:
(a) F(w, x, y, z) =

(0, 2, 5, 6, 7, 8, 10)
00 01 11 10
00
01
11
10
F

wx
yz
1 1
1
1 1
1 1 1 1
_
`

_
`

_

The reduced SOP for the complement is F

= wx+x

z +xy

so the reduced POS is F(w, x, y, z) =

(w

+x

)(x +z

)(x

+y +z)
5
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(b) F(A, B, C, D) =

(1, 3, 5, 7, 13, 15)

00 01 11 10
00
01
11
10
F

AB
CD
1 1
1 1
1 1
_

The reduced SOP of the complement is F

= A

D + BD so the reduced POS is F(A, B, C, D) =

(A+D

)(B

+D

)
3-15 Simplifying the following Boolean functions F, together with the dont-care conditions d, and then
expressing the simplied function in sum of minterms:
(a) F(x, y, z) =

(0, 1, 2, 4, 5)
d(x, y, z) =

(3, 6, 7)
00 01 11 10
0
1
F
x
yz
1 1 1 X
1 1 X X
_

The reduced SOP is F(x, y, z) = 1 =

(0, 1, 2, 3, 4, 5, 6, 7)
6
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
(b) F(A, B, C, D) =

(0, 6, 8, 13, 14)

d(A, B, C, D) =

(2, 4, 10)
00 01 11 10
00
01
11
10
F
AB
CD
1
1
1
1 1
X
X
X
_
`

_
`

The reduced SOP is F(A, B, C, D) = ABC

D + B

+ CD

which is equivalent to the sum of

minterms F(A, B, C, D) =

(0, 2, 6, 8, 10, 13, 14)

(c) F(A, B, C, D) =

(1, 3, 5, 7, 9, 15)
d(A, B, C, D) =

(4, 6, 12, 13)

00 01 11 10
00
01
11
10
F
AB
CD
1 1
1 1
1
1
X X
X X
_
`

The reduced SOP is F(A, B, C, D) = C

D +BD +A

D which is equivalent to the sum of minterms

F(A, B, C, D) =

(1, 3, 5, 7, 9, 13, 15)

7
EE/COSC 2390 Homework Set 4 Solutions Spring 2004
3-33 Use the data-ow (Boolean expression with assign) format for writing the prescribed Verilog circuit
description.
module smpl_circuit(A,B,C,x,y);
input A, B, C;
output x, y;
assign x = A&B | ~C;
assign y = ~C;
endmodule
3-36 The logic diagram for the given HDL description:
8