Lecture #29 CMOS fabrication, clocked and latched circuits • Last lecture: PMOS – Physical structure – CMOS – Dynamic circuits (Ring oscillators) • This lecture: – CMOS fabrication – Clocked and latched circuits 11/8/2004 EE 42 fall 2004 lecture 29 1 CMOS PARAMETERS 3 generations of CMOS Parameter L (m) IDS’ (A/[V-m]) V-1 VT V) VDSAT V) dOX nm) CGS ‘fF/m2) VDD V) NMOS (0.25m) 0.25 350 0.05 0.5 1 5 7 2.5 PMOS (0.25m) 0.25 -175 0.05 - 0.5 -1 5 7 2.5 NMOS (0.18m) 0.18 500 0.07 0.4 0.75 3.5 10 1.8 PMOS (0.18m) 0.18 - 250 0.07 - 0.4 - 0.75 3.5 10 1.8 NMOS (0.13m) 0.13 650 0.1 0.4 0.6 2.5 14 1.5 PMOS (0.13m) 0.13 - 325 0.1 - 0.4 - 0.6 2.5 14 1.5 Return 11/8/2004 EE 42 fall 2004 lecture 29 2 Interconnect layers • On top of the transistor layers, many metal layers interconnect the logic Illustration 11/8/2004 Actual TEM photo EE 42 fall 2004 lecture 29 3 MOS Fabrication and LAYOUT Drain contact W Gate (over oxide) Source contact Device dimensions are larger than gate dimensions Gate Length = L L Gate Width = W Thick oxide on silicon Thin oxide 11/8/2004 EE 42 fall 2004 lecture 29 4 Integrated Circuit Fabrication Goal: Mass fabrication (i.e. simultaneous fabrication) of hundreds of “Chips”, each a circuit (such as a microprocessor or memory chip) containing millions of transistors Method: Lay down thin films of semiconductors, metals and insulators and pattern each layer with a process much like printing (lithography). Minimum set of materials in an integrated circuit • Si substrate • SiO2 insulator • Polysilicon gate • Metal contacts and wiring Other materials generally used (but not discussed here) Tungsten metal, Silicon nitride insulator, TiN and TiSi conductor regions 11/8/2004 EE 42 fall 2004 lecture 29 5 Patterning the Layers - Lithography Goal: Transfer the desired pattern information to the wafer (for example the geometry of a wire) Scheme: Subtractive Patterning … that means for example deposit a uniform film of Aluminum and then selectively remove it (etch it away) where you don’t want it. Process for applying the pattern: Photolithography How Photolithography works: – Coat the the uniform film to be etched with a photosensitive material – Expose the photosensitive material with a “picture” of the desired pattern (much like photographic printing) – Develop away the exposed areas – Use the resulting pattern to mask the etching of the underlying film 11/8/2004 . EE 42 fall 2004 lecture 29 6 Exposure Process A glass mask with a black/clear pattern is used to expose a wafer coated with about 1 m of photoresist (image projected with optical system) We will shine UV light onto mask Mask Image of mask will appear here Lens photoresist oxide Si wafer 11/8/2004 EE 42 fall 2004 lecture 29 7 Review Exposure Process • A glass mask with a black/clear pattern is used to expose a wafer coated with about 1 m of photoresist UV light Mask Image of mask will appear here (3 dark areas, 4 light areas) Lens photoresist oxide wafer Areas exposed to UV light are susceptible to being chemically removed (developed) 11/8/2004 EE 42 fall 2004 lecture 29 8 Photoresist Development and Etching • Solutions with high pH dissolve the areas exposed to UV; unexposed areas (under the black patterns) are not dissolved Exposed areas of photoresist oxide layer After developing the photoresist Developed photoresist oxide layer After etching the oxide 11/8/2004 oxide EE 42 fall 2004 layer lecture 29 9 CMOS D G S G D S oxide p p n-well 11/8/2004 n n P-Si EE 42 fall 2004 lecture 29 10 Basic CMOS Inverter Inverter CMOS Inverter IN VDD OUT IN VDD p-ch OUT n-ch Al “wires” IN VDD PMOS Gate Example layout of CMOS Inverter N-WELL OUT NMOS Gate GROUND 11/8/2004 EE 42 fall 2004 lecture 29 11 Al “wires” IN VDD PMOS Gate N-WELL OUT NMOS Gate GROUND 11/8/2004 EE 42 fall 2004 lecture 29 12 Data Synchronization problem • Combinatorial logic gates can give incorrect answers prematurely and may take several gate propagation delays produce an answer. • Clocks (signals as to when to proceed) and latches (which capture and hold the correct outputs) can provide synchronization. 11/8/2004 EE 42 fall 2004 lecture 29 13 Combinatorial vs Sequential logic • In the digital circuits we have created so far, the output was a function only of the instantaneous inputs. – combinational logic circuits. • If the action of circuits depends on the history of the inputs, or on past operations, they are – sequential logic circuits. 11/8/2004 EE 42 fall 2004 lecture 29 14 Combinatorial • A combinatorial circuit can be schematically represented as a black box, and is completely described by a truth table of the outputs as a function of the current inputs 11/8/2004 EE 42 fall 2004 lecture 29 15 dynamic circuit • the output is a function not only of the current inputs, but of the internal state of the circuits, residual from previous inputs. The circuit can not be described by a truth table of the inputs only. A B C 11/8/2004 Outputs EE 42 fall 2004 lecture 29 16 Ring oscillator as an example of a dynamic circuit VDD STAGE 1 STAGE 101 Vout At at time equal to exactly 1001 gate delays, the input to stage 1 will go high, and after another equal time it will go low, etc. This is a “RING OSCILLATOR”, which toggles at a frequency equal to 1/(1001 tdelay ). Such ring oscillators are commonly used to estimate the performance of a technology. No switch is actually needed, the output is permanently wired to the input, and the oscillations start when power is applied. 11/8/2004 EE 42 fall 2004 lecture 29 17 Unpredictability of dynamic circuits • In the case of the ring oscillator, the output just oscillates forever without regard to its inputs. • If there are many different paths and possible delays, the output of the circuit can be highly unpredictable or chaotic, because just what may happen at an instant in time can depend on the exact value of all the previous delays. 11/8/2004 EE 42 fall 2004 lecture 29 18 Representing a Discrete Sequence in Continuous Time • From our viewpoint, time appears to be a continuous variable. • For a digital sequence, we want discrete values • [x0,!x1, x2, x3, …], not a continuous function x(t). • The typical way to handle this is to use a clock. • The continuous sequence is “sampled” at regularly spaced times, when the clock “ticks”. 11/8/2004 EE 42 fall 2004 lecture 29 19 Making time discrete • The most common answer to this complexity is the same one we used for simplifying circuits before, but this now we make time discrete. • Rather than letting all of the internal nodes take logical states at arbitrary times, we use latches to prevent the change of state of some nodes until a specific time. 11/8/2004 EE 42 fall 2004 lecture 29 20 sequential circuit • In a sequential circuit, the circuit can be described by a truth table as a function of the inputs and the values held byf internal latches. A B C 11/8/2004 Outputs EE 42 fall 2004 lecture 29 21 Dynamic Latch VDD To synchronize the data, L remains low until the data is correct. When L goes high the inverse of the data is passed. L VOUT VIN COUT L 11/8/2004 Note that in a dynamic latch, the old value is just held by the capacitance, which works in CMOS because of the low leakage of the switches, and the fact that the next gate consumes no current. When L is low, the voltage at the output is left floating EE 42 fall 2004 lecture 29 22 Latches • A latch remembers one bit, either a 0 or 1. • The bit is held while the latch is low, until the next time the latch is high. • Each time the latch line pulses, whatever value (0 or 1) exists at the flip-flop’s input is remembered; the old value is lost. • While the latch is high, the output will follow the input 11/8/2004 EE 42 fall 2004 lecture 29 23 Feedback Can Provide Memory Feed back between gates can form a circuit with static memory. This kind of circuit is called a flip-flop H H Q L L Q H H 11/8/2004 EE 42 fall 2004 lecture 29 24 the Opposite State H L Q H H H 11/8/2004 Q L EE 42 fall 2004 lecture 29 25 Set/Reset S Q Q R 11/8/2004 EE 42 fall 2004 lecture 29 26 Set/Reset flip-flop • This circuit will do the following 1. If S=0 and R=0, Q will not change, but will remember its former value. 2. If S=1 and R=0, then Q=1 3. If S=0 and R=1, then Q=0 4. S=1 and R=1 is an illegal combination 11/8/2004 EE 42 fall 2004 lecture 29 27 Set/Reset flip-flop with clock S Q φ Q R 11/8/2004 EE 42 fall 2004 lecture 29 28 sequential circuit • In a dynamic circuit with latches, we still have a race when a latch passes a value, of its output feeds back to its input. A B C 11/8/2004 Outputs EE 42 fall 2004 lecture 29 29 Two phase latches • If we put two latches into every feedback path, and make sure both latches are never open at the same time, we can insure predicable results. A B C 11/8/2004 Outputs EE 42 fall 2004 lecture 29 30 Asynchronous vs. clocked logic • One straightforward way of making sure that the behavior is predictable, and does exactly what it was designed to do, is to latch all of the circuits in the block by one signal, which is called a clock. • If a dynamic circuit is built without a clock, it is called asynchronous logic. • It is possible to build fast, low power asynchronous circuits, but difficult to make complex systems which behave correctly 11/8/2004 EE 42 fall 2004 lecture 29 31 Clocked logic • If we put two latches into every feedback path, and make sure both latches are never open at the same time, we can insure predicable results. A B C Outputs 11/8/2004 EE 42 fall 2004 lecture 29 32