HW-3 Sept. 18, 2001 Name ____________________Answers__________HW-3 p. 1ECE2030b HW-3 Due Wed. Sept.18, 2002 in class.Simplify the Boolean expression: Out = ABC + AC’ = A (BC+C’) = A (B+C’)Complete the truth table. [ Bonus: Expand to minterms: ABC + ABC’ + AB’C’ (7,6,4)]ABCOut00000010010001101001101011011111Draw the CMOS transistor diagram. Assume A, A’, B, B’, C, C’ signals are available.OutACB’A’B’CA’HW-3 Sept. 18, 2001 Name ____________________Answers__________HW-3 p. 2Given the truth table.ABCOut00010011010101101001101011001110Write the Boolean expression as 3 terms:Out = A’B’C’ + A’B’C + A’BC’ +AB’C’ = A’B’ + (A’B + AB’) C = (A’B’C’ + A’B’C) + (A’B’C’ + A’BC’) + (A’B’C’ + AB’C’) = A’B’ + A’C’ + B’C’Draw the CMOS transistor diagram. Assume A, A’, B, B’, C, C’ signals are available.(DO YOU SEE A WAY TO ELIMINATE 2 FET’S)OutBAACBCBAACBCHW-3 Sept. 18, 2001 Name ____________________Answers__________HW-3 p. 3Bonus – use a Karnaugh map to find the simplest logic expression for Problem 3. There arethree Essential Prime Implements, A’C’ (blue), B’C’ (green), and A’B’ (red).A \
View Full Document
Unlocking...