Problems 35 -20 Convert decimal +49 and +29 to binary, using the signed-2's-complement representation and enough digits to accommodate the numbers. Then perform the binary equivalent of (429) + (49), (29) + (+49), and (-29) + (~49). Convert the answers back to decimal and verify that they are correct. 21. Ifthe numbers (49,742);9 and (4641)jo are in signed magnitude format, their sums (+10,383)0 and requires five digits and a sign. Convert the numbers to signed-10's-complement form and. find the following sums: (a) (49,742) + (4641) (bd) (49,742) + (641) (©) (9.742) + (+641) (a) (9,742) + (641) -22 Convert decimal 6,514 to both BCD and ASCII codes. For ASCII an even parity bit is to bbe appended at the left. -23 Represent the unsigned decimal numbers 791 and 658 in BCD, and then show the steps necessary to form their sum. .24 Formulate a weighted binary code for the decimal digits, using the following weights: ()* 6,311 (b) 6,4,2,1 .25 Represent the decimal number 6,248 in (a) BCD, (b) excess-3 code, (c) 2421 code, and (A) 26311 code. 26 Find the 9's complement of decimal 6,248 and express it in 2421 code, Show that the result is the 1’s complement of the answer to (c) in CR_PROBlem 1.25. This demonstrates that, the 2421 code is self-complementing, -27 Assign a binary code in some orderly manner to the 52 playing cards, Use the minimum number of bits. .28 Write the expression “G. Boole” in ASCH, using an eight-bit code. Include the period and the space. Treat the leftmost bit of each character as a parity bit. Each eight-bit code should have odd parity. (George Boole was a 19th-century mathematician. Boolean algebra, introduced in the next chapter, beats his name.) .29* Decode the following ASCII code: 1010011 1110100 1100101 1110110 1100101 0100000 1001010 1101111 1100010 1110011 -30 The following is a string of ASCII characters whose bit patterns have been converted into hexadecimal for compactness: 73 F4 ES 76 E5 4A EF 6273. Of the eight bits in each pair of digits, the leftmost is a parity bit. The remaining bits are the ASCII code. (a) Convert the string to bit form and decode the ASCII (b) Determine the parity used: odd or even? -31* How many printing characters are there in ASCII? How many of them are special char- acters (not letters or numerals)? -32* What bit must be complemented to change an ASCII letter from capital to lowercase and vice versa? 33% The state of a 12-bit register is 100010010111, What is its content if it represents (a) Three decimal digits in BCD? (b) Three decimal digits in the excess-3 code? (©) Three decimal digits in the 84-2-1 code? (@) A binary number?36 Chapter 1 ital Systems and Binary Numbers 1.34 List the ASCII code for the 10 decimal digits with an even parity bit in the leftmost position. 1.35. By means of a timing diagram similar to Fig. 15, show the signals of the outputs f and g in Fig. P1.35 as functions of the three inputs a, b, and c. Use all eight possible combinations of a,b,and c. abe FIGURE P1.35, 1.36 By means of a timing diagram similar to Fig. 15, show the signals of the outputs f and g in Fig. P1.36 as functions of the two inputs a and b. Use all four possible combinations of a and b. > FIGURE P1.36 REFERENCES 1. Cavanaon, J.J. 1984. Digital Computer Arithmetic. New York: McGraw-Hill Mano, M. M. 1988. Computer Engineering: Hardware Design. Englewood Cliffs, NJ: Prentice-Hall. 3. Netson, V. P, H. T. Nacue, J.D. Irwin, and B, D. Carrot. 1997, Digital Logic Circuit Analysis and Design. Upper Saddle River, NJ: Prentice Hall. 4. Scunap, H. 1974. Decimal Computation. New York: John Wiley 5. Karz,R.H_and Borist10, G. 2004. Contemporary Logic Design, 2nd ed. Upper Saddle River, NJ: Prentice-Hall.Problems 69 PROBLEMS (Answers to problems marked with * appear at the end of the text.) 241 22 23 24 25 26 27 28 29 2.10 21 ‘Demonstrate the validity of the following identities by means of truth tables: (a) DeMorgan’s theorem for three variables: (x + y + z)' = x’y'z" and (xyz)! = xityitz (b) The distributive law: x + yz = (+y)(x+2) (©) The distributive law: x(y + 2) =xy + xz (A) The associative law:x + (y +z) = (x+y) +2 (c) The associative law and x(yz) = (xy)z Simplify the following Boolean expressions to a minimum number of literals: (a)* ay tay" (b)* (e+ y) (+ y') ()* aye tr'y bxyz (dy* (AF BY'(A" + BY) (©) (arb ¥e'Va’ bi +0) (Q) a’be-+ abe! +abe + a'be' Simplify the following Boolean expressions to a minimum number of literals: (a)* ABC + A'B + ABC (b)* x’yetxz (Or @ +y)'@' Hy") (d)* xy tx(wz +2!) ()* (BC" + A'D) (AB’ + CD’) ® (te) (a+b +e) Reduce the following Boolean expressions to the indicated number of literals: (a)* AC! + ABC + AC’ to three literals (b)* Gy! + 2)! bz + xy + we to three literals (0° AB! + C’D) + B(A + A’CD) to one literal (@* (A+ OA + 0) (A+ B+ CD) to four literals (©) ABCD +A'BD + ABCD to two literals Draw logic diagrams of the circuits that implement the original and simplified expressions in Problem 2.2. Draw logic diagrams of the circuits that implement the original and simplified expressions in Problem 2.3. ‘Draw logic diagrams of the circuits that implement the original and simplified expressions in Problem 2.4. Find the complement of F= wx + yz; then show that FF’ = Qand F + F’ = 1 Find the complement of the following expressions: (a)* xy tx'y (b) (a6) (a+b') (a +b +e") ( z+z'W’weay) Given the Boolean functions F, and F,, show that (a) The Boolean function E ~ F, + F, contains the sum of the minterms of F, and Fy (b) The Boolean function G = FF; contains only the minterms that are common to F, and Fy. List the truth table of the function: (a)* Foaytay'+y'z (b) F ‘We can perform logical operations on strings of bits by considering each pair of correspond- ing bits separately (called bitwise operation). Given two cight-bit strings A = 10110001 and B = 10101100, evaluate the eight-bit result after the following logical operations (a)* AND (b)OR_— (@)* XOR_ (d)* NOTA (¢)NOTB beta'e!70 Chapter 2. Boolean Algebra and Logic Gates 2.13 2.14 2.15* 2.16 217 2.18 Draw logic diagrams to implement the following Boolean expressions: (a) y=[@+x') 0" +2)] (b) y=@ @ y)' +x (© y= Fx) (p42) (@) y=ue @ 2) ty" (©) youtyz tury () yrutxex'ury’) Implement the Boolean function Foxy + xy! + y'z (a) With AND, OR, and inverter gates (b)* With OR and inverter gates (©) With AND and inverter gates (4) With NAND and inverter gates (©) With NOR and inverter gates Simplify the following Boolean functions T; and 7; to a minimum number of literals: A B € Th o 0 0 1 0 o o 1 1 0 o 1 0 1 0 oO 2 1 0 1 1 06 0 0 1 1 0 1 o 1 1 1 0 0 1 1 1 1 ot ‘The logical sum of all minterms of a Boolean function of n variables is 1 (a) Prove the previous statement for n=3. (b) Suggest a procedure for a general proof, Obtain the truth table of the following functions, and express each function in sum-of-min- terms and product-of- maxterms form: (a)* (b+ ed)(c+ bd) (b) (cd + b’e+bd')(b +d) © ('+d)b+e’) (d) bd! + acd! + ab'c+a'e! For the Boolean function Fa axy'c + x'y'z + wiry + wx'y + wry (a) Obtain the truth table of (b) Draw the logic diagram, using the original Boolean expression. (0)* Use Boolean algebra to simplify the function to a minimum number of literals. (d) Obtain the truth table of the function from the simplified expression and show that itis the same as the one in part (a). (e) Draw the logic diagram from the simplified expression, and compare the total number of gates with the diagram of part (b)Problems 71 2.19* Express the following function as a sum of minterms and as a product of maxterms: (A,B, C,D) = B'D + AD + BD 2.20 Express the complement of the following functions in sum-of-minterms form: (@) FIA.B,G D) = 3(2,4,7,10, 12, 14) () FO», 2)=11G.5,7) 2.21 Convert each of the following to the other canonical form: (@) Fsy,2)= 20.3.5) (b) F(A, B,C D)=TI(3,5,8,11) 2.22° Convert each of the following expressions into sum of products and product of sums: (a) (u+x0)(e+u'v) (0) x xGe + Vy + 2’) 2.23 Draw the logic diagram corresponding to the following Boolean expressions without sim- plifying them: (a) BC’ + AB + ACD (b) (A + BY(C + D)(A' + B+ D) (0) (AB = A'BY(CD’ + C'D) (@) A+CD+(A+DY(C'+D) 2.24 Show that the dual of the exclusive-OR is equal to its complement 2.25 By substituting the Boolean expression equivalent of the binary operations as defined in ‘Table 2.8, show the following (a) The inhibition operation is neither commutative nor associative (b) The exclusive-OR operation is commutative and associative, 2.26 Show that a positive logic NAND gat 2.27 Write the Boolean equations and draw the logic diagram of the circuit whose outputs are defined by the following truth table: a negative logic NOR gate and vice versa. Table P2.27 fh of a ob «¢ 1 1 0 0 0 0 1 0 0 1 1 0 0 1 0 1 1 0 4 1 1 0 1 60 0 0 1 1 0 41 1 0 1 1 1 2.28 Write Boolean expressions and construct the truth tables describing the outputs of the circuits described by the logic diagrams in Fig. P2.28. 2.29 Determine whether the following Boolean equation is true or false. xl! bextz tte! a x'e! ty’! 4 x's72 Chapter 2 Boolean Algebra and Logic Gates =D (a) (b) FIGURE P2.28 2.30. Write the following Boolean expressions in sum of products form: (b+ da’ +b’ +0) 2.31 Write the following Boolean expression in product of sums form: a'b + a'e! + abe REFERENCES 1. Boote, G. 1854. An Investigation of the Laws of Thought. New York: Dover. Dretmeyer, D. L. 1988. Logic Design of Digital Systems, 3rd ed. Boston: Allyn and Bacon. 3. _ HunnINeToN, E. V. Sets of independent postulates for the algebra of logic. Trans. Am. Math Soc.,5 (1904): 288-309. 4. IEEE Standard Hardware Description Language Based on the Verilog Hardware Descrip- tion Language, Language Reference Manual (LRM), IEEE Std.1364-1995, 1996, 2001, 2005, The Institute of Electrical and Electronics Engineers, Piscataway, NJ. 5. IEEE Standard VHDL Language Reference Manual (LRM), IEEE Std. 1076-1987, 1988, The Institute of Electrical and Electronics Engineers, Piscataway, NJ. 6. MANo,M. M. and C. R. Kime. 2000. Logic and Computer Design Fundamentals, 2nd ed. Upper Saddle River, NJ: Prentice Hall. 7. SHANNoN, C. E. A symbolic analysis of relay and switching circuits. Trans. AIE, 713-723, 7 (1938): WEB SEARCH TOPICS Algebraic field Boolean logic Boolean gates Bipolar transistor Field-effect transistor Emitter-coupled logic TTL logic CMOS logic CMOS process