Computer Science 237
Computer Organization
Williams College
Fall 2006
Lecture 10: Combinational Circuits, Simplification
Date: September 29, 2006
Agenda
Announcements
Lab 3 continues.
Exam next week
out up at the end of class on Wednesday, due at the start of class Friday
expect to spend 90-120 minutes, take all in one sitting only
you may use your own class notes and graded labs for reference, nothing else
topics up to last class are fair game
Generation of all
combinational
functions (functions that are determined by inputs only)
Multi-input gates: when constructing an
n
-input gate, we will have
n-1
gate equivalents charged to
transistor budget
real estate on the chip/board
and
O(logn)
gate delay
Avoid "wired OR"; limit fan out
Simplification - Karnaugh maps
Examples
