Digital Systems Design

HW #2
Due date: March 16, 2017

1. Convert the decimal numbers +37 and +17 to 8-bit hexadecimal numbers, unsing the
signed 2s complement representation. Then perform the following operations: (a) (+37)
+ (17), (b) (37) + (+17), (c) (37) + (17). Convert the answers back to decimal and
verify that they are correct.
2. Convert the following binary numbers to ASCII code:
1001000 1100101 1101100 1101100 1101111 0101100 0100000 1110111
1101111 1110010 1101100 1100100 0100001
3. By means of a timing diagram similar to Figure 1.5, show the signals of the outputs f and
g in the figure below as functions of the two inputs a and b. Use all four possible
combinations of a and b?

4. Demonstrate the validity of the following identities by means of truth tables:

a) DeMorgans theorem for three variables: (x+y+z) = xyz and (xyz) = x + y + z
b) The Distributive law: x + yz = (x + y)(x + z)
5. Simplify the following Boolean expressions to a minimum number of literals.

6. Draw logic diagrams of the circuits that implement the original and simplified
expressions in: Problem 5 (c) and (d)
7. Find the complements of the following expressions:

8. Implement the Boolean function

F = xy + xy + yz
(a) with AND, OR and inverter gates,
(b) with NAND and inverter gates,
(c) with NOR and inverter gates.
1
9. Simplify the following Boolean functions T1 & T2 to a minimum number or literals:
A B C T1 T2
0 0 0 1 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 0 1

10. Obtain the truth table of the following functions, and express each function as a sum- of-
minterms and a product-of-maxterms:
(a) (x + y)(y + z)
(b) (xy + yz + xz)(x + z)

11. Express the following as a sum of minterms and as a product of maxterms:

F(A, B, C, D) = BD + AD + BD

12. Convert each of the following to the other canonical form:

(a) F(x, y, z) = (3, 5, 6)
(b) F(A,B,C,D) = (0, 1, 3, 8, 9, 11)

13. Convert each of the following expressions into sum of products and product of sums:
(a) (AB + C)(B + CD)
(b) x + x(x + y)(y + z)

14. Simplify the following Boolean functions using three-variable maps:

(a) F(x, y, z) = (0, 1, 3, 7)
(b) F(x, y, z) = (0, 1, 2, 4, 5)
(c) F(x, y, z) = (2, 3, 4, 5)

15. Simplify the followin Boolean expressions using three-variable maps:

(a) F(x, y, z) = xy + xyz + xyz
(b) F(x, y, z) = xy + yz + xyz
(c) F(x, y, z) = xy + yz + yz
(d) F(x, y, z) = xyz + xyz + xyz

16. Simplify the following Boolean functions, using Karnaugh maps:

(a) F(x, y, z) = (1, 3, 5, 7)
(b) F(w, x, y, z) = (7, 12, 14, 15)
(c) F(A,B,C,D) = (1, 5, 9, 12, 13, 15)
(d) F(w, x, y, z) = (0, 1, 5, 8, 9, 13)
(e) F(w, x, y, z) = (0, 1, 2, 3, 5, 9)

Note: Let submit on the due date. Otherwise, a penalty of 20% per day will be
applied!