o 14 Problems Deawwsvn, M.“A Map Method for Synthesis of Combinational Logic “Circuits Transactions of AIEE, Communication and Electronics, 72, part | (November 1953), 593-99 DirrweveR, D. L. Logie Design of Digital Systems, 3rd ed. Boston: Allyn & ‘Bacon, 1988. Maxo. M. M. Digital Design, 3rd ed. Upper Saddle River, NI: Prentice Hall, 2002. & WAKERLY, J. F Digital Design: Principles and Practices, th ed, Upper Saddle River, NJ: Pearson Prentice Hall, 2004. © 6. Guiski, D.D. Principles of Digital Design. Upper Saddle River, NI: Prentice Hall, 1997, 7. IEEE Standard Graphic Symbols for Logic Functions (includes IEEE Std 91a 1991 Supplement and IEEE Std 91-1984). New York: The Institute of Electrical and Electronics Engineers, 1991 PROBLEMS ‘The plus (+) indicates a more advanced problem and the asterisk (") indicates that solution is available on the Companion Website forthe text. 241, “Demonstrate by means of truth tables the validity of the following identities: (@))DeMorgan’s theorem for three variables: XVZ = K+ ¥+Z () The second distributive law: X + YZ = (X + Y\(X + Z) (©) RV +¥Z+XZ = XV+YZ+%z 22. *Prove the identity of each of the following Boolean equations, using algebraic ‘manipulation (@ X¥+Xv+xv-¥+¥ ()AB+BC+AB+BC =1 LO Y+RZ+X¥ = K+ +z ( RV+PZ+NZ+ XY + YZ = RV EXE + YZ 23. +Prove the identity of each of the following Boolean equations, using algebraic ‘manipulation (®) ABC +BCD + BC+CD = B+ CD () WY +WYZ + WZ -+WXY = WY + WXZ + RYZ+XPZ (9 AD+AB+CD+BC = (A+B+T+DYA+B+C4D) 2-4) Given that A-B = 0 and A +B = L.use algebraic manipulation to prove that (A+C)-(A+B)-(B+C) = BC 2-8. +A specific Boolean algebra with just two elements 0 and 1 has been used in this chapter. Other Boolean algebras can be defined with more than two92 O CHAPTER 2 / COMBINATIONAL LOGIC CIRCUITS elements by using clements ths algebras form the mathematical f that we will study in Chapter 7, Suppose that 24. rR 29, 2K at correspond to binary strings. These ‘sundation for bitwise logical operations tthe strings are each a nibble that ve Spy atfour bis Then there ae 2, oF 16, elements in the lee Chal oF oy ee T i the “bit aibble in binary corresponding 10 T in rea eed on bitwise application ofthe tworclement Boolean algebra See eine following for the new algebra sO that the Boolean identities hold (@) The OR operation A (0) The AND operation {@)The clement that acts asthe 0 fr the algebra {Gy The element that acts asthe 1 for the algebra {@) For any element A, the clement 4. 4 B for any two elements A and B [AB for any two elements A and B Simpy the following Boolean expresions to expressions containing & miniowum number of literals (a) AC+ABC+BC (a+B+O- ABC (@ ABC +AC (a) ABD + (ey (At ByA +CABC) Reduce the following Boolean expressions t literals (a) EV +XYZ-4KY to thee literals () X+¥(Z+XFZ) to wo iterals (@ WHE +¥Z)+X(W + WYZ) to one literal (@ (AB-+ABYCD + CD) + AC to four literals Using DeMorgan's theorem, express the function pe ABC+AC+AB to the indicated number of (a) with only OR and complement operations (b) with only AND and complement operations. Find the complement of the following expressions: (a) AB+AB (b) (OW XV 4Z to WH(PZ + YZ) + WHY + ZY + 2 (a) (A+ B+ CAB + CA +BQ) feof the following functions, and express each f ‘of-maxterms form: junction “Obtain the truth tabl in sum-of-minterms and product (a) (XY + ZV +XZ) 0.() (A+BY\B +O) io 5 WAY + WXZ + WXZ4 YZ ‘eit. For the Boolean functions E and F as given in the following truth table: (a) List the minterms and maxterms of each function, (b) List the minterms of E and F. (©) List the minterms of E + Fand E-F. (@) Express E and F in sum-of-minterms algebraic form. (e) Simplify £ and F to expressions with a minimum of literals 212. *Convert the following expressions into sum-of-products and product-of- sums forms: (a) (AB +C(B+CD) (by K+ XK + VV +Z) (©) (A +BC+CD)(B + EF) 2213, Draw the logic diagram for the following Boolean expressions. The diagram should correspond exactly to the equation. Assume that the complements of the inputs are not available. (a) XYZ+XY+XZ (b) BAC + AC) + D(A + BC) (co) XY(W +Z) + WYK + Z) + WVX+Z) 2-14, Optimize the following Boolean functions by means ofa three-variable map: (a) FG Y,Z) = 30n(0,2,6,7) () FLX Y.Z) = Em(0,1,2.4) (@|FLA,B,C) = 3m(0,2,3,4,6) (@ FLA.B.C) = E(0,2,3,4,5,7) 2-48, *Optimize the following Boolean expressions using a map: (a) XZ + YZ+ XYZ