This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: LSU EE 2720-2 Homework 3 Due: 19 October 2011 Note: This assignment is based on material covered in Brown and Vranesic 2nd Edition Sec- tions 2.3 (truth tables), 2.4 (logic gates and networks), 2.5 (Boolean algebra), 2.6.1 (SoP and PoS forms; canonical forms), 2.7 (NAND and NOR networks), 2.8 (design examples). Problem 1: The Boolean expression below is from Midterm Exam 1. ( a ) Draw a logic diagram (show the gates) corresponding to the following Boolean expression. (As written, dont simplify it first.) Use AND, OR, and NOT gates. x y + x y z + y w x ( b ) In the expression below xy has been factored out. Draw a logic diagram corresponding to this expression. As far as the diagram is concerned, treat the 1 as an input ( x , y , z , and w are the real inputs). Note: If this is solved correctly then something in the diagram should look foolishly wasteful. See the next part. x y (1 + z + w ) ( c ) The simplified form of the expression is just x y . Explain why thats much more obvious in the second diagram above (where...
View Full Document
- Fall '09