Lecture Digital logic design - Lecture 13: Problems (Mano). The main contents of the chapter consist of the following: Design a combinational circuit with three inputs and one output, design a combinational circuit that converts a four bit Gray code to four bit binary number,...
Lecture 13 Problems (Mano) Problems (Mano) °Obtain the simplified Boolean expressions for outputs F and G in terms of the input variables in (A,B,C and D) Problems (Mano) Problem (Mano) Design a combinational circuit with three inputs and one output a) The output is when binary value of the inputs is less than 3, the output is zero otherwise b) The output is when binary value of the inputs is an odd number Problem (Mano) Design a combinational circuit with three inputs and one output b) The output is when binary value of the inputs is an odd number Problem (Mano) Design a combinational circuit with three inputs x, y and z and three outputs A, B and C, when the binary input is 0, 1, or 3, the binary output is two greater than the input When the binary input is 4, 5, or 7, the binary output is three less than the input Problem (Mano) Design a combinational circuit with three inputs x, y and z and three outputs A, B and C, when the binary input is 0, 1, or 3, the binary output is two greater than the input When the binary input is 4, 5, or 7, the binary output is three less than the input Problem (Mano) Design a combinational circuit with three inputs x, y and z and three outputs A, B and C, when the binary input is 0, 1, or 3, the binary output is two greater than the input When the binary input is 4, 5, or 7, the binary output is three less than the input Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 10 Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 11 Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 12 Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 13 Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 14 Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segment in the display as shown in Fig The numeric display chosen to represent the decimal digit is also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 15 Problem (Mano) Design a combinational circuit that converts a four bit Gray code to four bit binary number 16 Problem (Mano) Design a combinational circuit that converts a four bit Gray code to four bit binary number 17 Problem (Mano) Design a combinational circuit that converts a four bit Gray code to four bit binary number 18 Problem (Mano) Design a combinational circuit that converts a four bit Gray code to four bit binary number 19 Exa mpl e: ° Problem: Detect three consecutive 1s Thrinput: abcdefgh in 8-bit ee- 00011101 10101011 1s 11110000 • Det Step 1: Capture the function ect - Truth table or equation? or – Truth table too big: 2 = 256 rows – - Equation: create terms for each possible case of three consecutive 1s y = abc + bcd + cde + def + efg + fgh • Step 2: Convert to equation already done • Step 3: Implement as a gate-based circuit °a °b °c °abc °bcd °d °e °cde °def °f °g °y °efg °fgh °h 20 Exa mpl e: ° Problem: Output in binary on Nu twomb outputs yz the number of 1s on three inputs er of- 010 01 101 10 000 00 • 1s Step 1: Capture the function - Truth table or equation? Cou nt – Truth table is straightforward • Step 2: Convert to equation - y = a’bc + ab’c + abc’ + abc - z = a’b’c + a’bc’ + ab’c’ + abc °a °b • Step 3: Implement as a gate-based°c circuit °a °b °c °a °b °a °b °c °a °b °y °c °a °b °c °z °a °b °c 21 ... also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates Problem (Mano) An ABCD-to-seven segment decoder is a combinational circuit... also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 10 Problem (Mano) An ABCD-to-seven segment decoder is a combinational... also shown in Fig Using the truth table and K-Map, design the BCD-to-seven-segment decoder using the minimum number of gates 11 Problem (Mano) An ABCD-to-seven segment decoder is a combinational