This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: transistors. ECE3060A Fall 2006, Midterm 1 3 2. (30pts) Consider the complex gate implementation of F = a ¯ b ⊕ a + c that uses the minimum number of transistors. Assume that complemented inputs are available. a) (15pts) Compute the worstcase RC delay of F driving a load of 5 C inv . Assume that the size of all transistors is ﬁxed to 1. b) (15pts) Compute the LE (logical eﬀort) delay of F driving a load of 5 C inv . Use input b , and assume that C in ( b ) = 2 C inv . The parasitic delay of F is 4. ECE3060A Fall 2006, Midterm 1 4 3. (40pts) Consider the following circuit. a b c d F a) (20pts) Draw the stick diagram of the complex gate implementation of F . Assume that complemented inputs are available. b) (20pts) Draw the stick diagram of the network of gate implementation of F . Use the gates given in the circuit. ECE3060A Fall 2006, Midterm 1 5 blank page...
View
Full
Document
This note was uploaded on 02/19/2010 for the course ECE 3060 taught by Professor Shimmel during the Spring '07 term at Georgia Tech.
 Spring '07
 Shimmel

Click to edit the document details