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: f ( x ) the output of the gate must be negated, i.e. f ( x ) f ( x ) ′ x Pull Up Network Pull Down Network The node connecting the pull up network to the pull down network is the o output of the gate 1. Write the the Boolean expression for the value of node X in the diagram. 2. Write the Boolean expression for the value of node Y in the diagram in terms of A,B,C,Z . 3. Fill out the following table, A B C X Z Y . . . 4. What does the circuit do? 5. Give the minterms with mnotation with E Z ( A,B,C ), and E Y ( A,B,C ). 6. Give the maxterms with Mnotation with E Z ( A,B,C ) and E Y ( A,B,C ). Problem 5 Exercise 3.6 from the book. Also compute worst case t pLH and t pHL for each gate, in addition to the equivalent cost of the circuit. 2...
View
Full
Document
This note was uploaded on 04/17/2008 for the course CS 151A taught by Professor Miloseragovich during the Fall '07 term at UCLA.
 Fall '07
 MilosEragovich

Click to edit the document details