ECE

171 Winter 2011 Homework 3 Solutions 1. [10] Show the truth table for the function ! = ! + ! ! .

2. [20] Consider the function ! = ! ! + ! !. a) Expand the function to its canonical or standard sum of products (SOP) form. b) Express the function in its canonical or standard product of sums (POS) form. c) Express the function in compact minterm form. d) Express the function in compact maxterm form. Each of these questions is more easily answered if we first generate the truth table (though its not essential).

a) b) c) d)

! ! ! !

= ! ! ! + ! ! ! + ! ! ! + ! ! ! = (! + ! + !) (! + ! + !) (! + ! + !) (! + ! + !) = (1,3,6,7) = (0,2,4,5)

3. [20] Consider the truth table below. a) Express the function f1 in compact minterm form. b) Express the function f1 in canonical sum of products form. c) Express the function f1 in compact maxterm form. d) Express the function f1 in canonical product of sums form. e) Express the function f2 in compact minterm form. f) Express the function f2 in canonical sum of products form. g) Express the function f2 in compact maxterm form. h) Express the function f2 in canonical product of sums form.

a) b) c) d) e) f) g) h)

!1 = (1,4,7) !1 = ! ! ! + ! ! ! + ! ! ! !1 = (0,2,3,5,6) !1 = (! + ! + !) (! + ! + !) (! + ! + !) (! + ! + !) (! + ! + !) !2 = (3,5,6,7) !2 = ! ! ! + ! ! ! + ! ! ! + ! ! ! !2 = (0,1,2,4) !2 = (! + ! + !) (! + ! + !) (! + ! + !) (! + ! + !)

4. [20] Repeat the problem above but for !1 and !2 in place of !1 and !2. a) !1 = (0,2,3,5,6) b) !1 = ! ! ! + ! ! ! + ! ! ! + ! ! ! + ! ! ! c) !1 = (1,4,7) d) !1 = (! + ! + !) (! + ! + !) (! + ! + !) e) !2 = (0,1,2,4) f) !2 = ! ! ! + ! ! ! + ! ! ! + ! ! ! g) !2 = (3,5,6,7) h) !2 = (! + ! + !) (! + ! + !) (! + ! + !) (! + ! + !)

5. [10] Youre involved in the design of a hand-held device to play blackjack (21). In addition to a 2- bit value for encoding the suit (e.g. hearts, diamonds, spades, and clubs) which need not concern us here, you are using a 4-bit code (b3,b2,b1,b0) to represent the value of a card, with 0000 unused but ace represented by 0001, two by 0010, etc. through ten. Jack, Queen, and King are represented by 1011, 1100, and 1101 respectively. The other 4-bit code values are unused. In blackjack the value of face cards (Jack, Queen, and King) as well as the ten card is 10. Create a truth table for the function F which is a 1 if the card has a value of 10 and is 0 otherwise. b3 b2 b1 b0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 F 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 or X 0 or X

6. [10] Write the canonical SOP form for the function in problem (5) above. ! !3, !2, !1, !0 = !3 !2 !1 !0 + !3 !2 !1 !0 + !3 !2 !1 !0 + !3 !2 !1 !0

7. [15] Use a K-map to minimize the function ! (!, !, ! ) = (1,2,3,5,7)

! !, !, ! = ! + ! !

8. [15] Use a K-map to minimize the function F w, x, y, z =

0,1,2,4,5,6,8,9,12,13,14

! = ! + ! ! + ! ! 9. [15] Use a K-map to minimize the function ! A, B, C, D = A B C + B C D + A B C D + A B C

! = ! ! + ! ! + ! ! ! 10. [15] Minimize the function above in POS form. Circling 0s instead of 1s, we get ! = ! ! + ! ! + ! ! , applying deMorgans Theorem we get ! = ! + ! ! + ! (! + ! )