HW 3 Sept 18 2001 ECE2030b HW 3 Name Answers 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 A B C Out 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1 Draw the CMOS transistor diagram Assume A A B B C C signals are available B C A A Out B A C HW 3 p 1 HW 3 Sept 18 2001 Name Answers Given the truth table A B 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 Write the Boolean expression as 3 terms C 0 1 0 1 0 1 0 1 Out 1 1 1 0 1 0 0 0 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 A A B B C C Out A B A C B HW 3 C p 2 HW 3 Sept 18 2001 Name Answers Bonus use a Karnaugh map to find the simplest logic expression for Problem 3 There are three Essential Prime Implements A C blue B C green and A B red A BC 0 1 HW 3 00 1 1 01 1 0 11 0 0 10 1 p 3
View Full Document
Unlocking...