Cmos Worksheet
Cmos Worksheet
Concept Inventory:
Notes:
Timing:
• tPD (propagation delay): how long after inputs are stable and valid until outputs are stable and valid =
max over all paths from input to output (sum of component tPD along path)
o tPD specification is an upper bound on all measured propagation delays
• tCD (contamination delay): how long output stays valid after inputs go invalid =
min over all paths from input to output (sum of component tCD along path)
o tCD specification is a lower bound on all measured contamination delays
Lenient gate:
• If a subset of a lenient gate’s inputs is suffice to guarantee an specific output value (i.e., the values of
the other inputs don’t matter in this case), then the output will remain valid and stable by transitions
on the irrelevant inputs.
• CMOS gates are naturally lenient
(B) Are all the implementations you selected for part (A) lenient?
Problem 2.
(A) A single CMOS gate, consisting of an output node connected to a single PFET-based pullup
circuit and a single NFET-based pulldown circuit (as described in lecture) computes F(A, B,
C, D). It is observed that F(1, 0, 1, 0) = 1. What can you say about the following values?
(C) A single CMOS gate, consisting of an output node connected to a single pullup circuit
containing one or more PFETs and a single pulldown circuit containing one or more NFETs
(as described in lecture), computes F(A,B) . F has the property that for all A,
F(A,0) = F(A,1) . What can you say about the value of F(1,0) ?
Problem 3.
For each of the functions F and G, if the function can be implemented using a A B C F G
single CMOS gate, please draw the corresponding single CMOS gate. If it
0 0 0 1 1
cannot be implemented using a single CMOS gate, then write NONE. For full
credit use a minimum number of FETs. 0 0 1 1 1
0 1 0 0 1
Draw CMOS implementation of Draw CMOS implementation of 0 1 1 1 0
F(A,B,C) below or write NONE if G(A,B,C) below or write NONE if 1 0 0 1 1
F cannot be implemented as single G cannot be implemented as single
CMOS gate. CMOS gate. 1 0 1 0 0
1 1 0 0 1
1 1 1 1 0
Consider the Boolean function that has the truth table shown to the right; a possible
implementation as a combinational circuit is shown in the schematic below. You
A B C H
may assume that the NOR2 and NAND2 components are combinational. 0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
tCD tPD 1 0 1 0
NOR2 0.01ns 0.05ns 1 1 0 1
NOR2
NAND2 0.01ns 0.03ns 1 1 1 0
NAND2
(A) Using the timing specifications shown above for NOR2 and NAND2, compute the
contamination and propagation delay for the implementation of H shown above.
Problem 5.
A gate-level schematic is shown below. Using the tCD and tPD information for the gate
components shown in the table below, compute tCD and tPD for the circuit.
tCD = ________ns
tPD = ________ns
A minority gate has three inputs (call them A, B, C) and one output (call it Y). The output will be
0 if two or more of the inputs are 1, and 1 if two or more of the inputs are 0.
In the space below, draw the pulldown circuit for a single CMOS gate that implements the
minority function, using the minimum number of NFETs. You needn’t draw the pullup circuit.
If you’re convinced that the function cannot be implemented as a single CMOS gate, give a brief,
convincing explanation.
Can it be implemented as single CMOS gate? Circle one: YES can’t tell NO
In his bid for the Lemelson Prize, Ben Bitdiddle has invented the
“flexible gate,” a single CMOS gate that implements different
functions depending how its inputs are wired up. The FlexGate®
(see figure at right) uses 6 PFETs in its pullup circuit and 6 NFETs
in its pulldown circuit..
A A A
B B B
C C C
D D D
E E E
F F F
The response of a combinational gate to a test input waveform is shown below. Each horizontal
division of the plot represents 10 ps.
(A) Based on the figure below, what is an appropriate choice for the contamination delay of the
gate?
(B) Based on the figure below, what is an appropriate choice for the propagation delay of the
gate?
For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.