- Class description handout (color postscript).
- Lecture 1: Introduction.
- Lecture 2: CMOS logic.
- Lecture 3: more CMOS logic
- CAST Lecture
- Lecture 4: Boolean minimization. K-maps, Quine-McCluskey minimization. Minimal gate networks.
- Lecture 5: Clocks. Registers.
- Lecture 6: Precharge logic. Charge sharing. PLAs and FSMs
- Lecture 7: Introduction to computer arithmetic. Addition and subtraction.
- Lecture 8: Addition, shifting, and multiplication.
- Lecture 9: Datapaths, control, layout.
- Lecture 10: The CMOS transistor p.
- Lecture 11: Applications of transistor equations: Logic thresholds, tau model.
- Lecture 12: More about the tau model. An example.
- Lecture 12: Scaling and short-channel effects.