Office: EEB 344
Office Hours: Thursdays 9-12
TA: Soroush Abbaspour
Office Hours: Mondays 10-12 in EEB 201
We will not be using a textbook for this class, but will instead
use handouts of PowerPoint slides and published papers from the literature.
These will be accessible from the class web site.
1. S. M. Sait and H. Youssef, VLSI Physical Design Automation: Theory and Practice, IEEE Press, Piscataway, NJ, 1995.
2. N. Sherwani, Algorithms for VLSI Physical Design
Automation, 3rd ed., Kluwer Academic Publishers, Boston, MA, 1995.
3. A. B. Kahng and G. Robins, On Optimal Interconnections
for VLSI, Kluwer Academic Publishers, Boston, MA, 1995.
4. M. Sarrafzadeh and C. K. Wong, An Introduction to VLSI
Physical Design, McGraw-Hill, New York, NY, 1996.
5. E. G. Friedman, ed., Clock Distribution Networks in VLSI Circuits and Systems, IEEE Press, New York, NY, 1995.
2. EE477L or EE577a
3. CSCI 455x
4. Graduate student standing
Integrated circuits are so complex
that they require a sophisticated battery of algorithms and software design
tools to aid in their design. Because the complexity and performance of
integrated circuits is evolving exponentially the techniques and tools used to
aid in their design are constantly evolving as well. This course reviews the
most fundamental algorithms and techniques underlying today's integrated
circuit physical design approaches, and also gives some context for new
This course may be of interest to a
number of types of students. The first are graduate students in the area of
computer-aided design. For these students it provides a one-semester
introduction to the area and a review of a significant amount of the material
for preliminary examinations in computer-aided design. A second type are those
students principally interested in the design of digital integrated-circuits.
For students embarking on a lifetime of using computer-aided design tools to
design circuits, some time spent in understanding the principles underlying
these tools will be well invested. A third class of students are those interested
in exploring the frontier between technology CAD areas such as device and
process modeling and mainstream CAD. With the increasing impact of processing
effects on integrated circuits in small process geometries this has been an
especially fruitful area of CAD research. Finally, this course may also be of
interest to computer science students who are interested in seeing a wide
variety of practical applications of algorithms and mathematical programming
techniques such as: shortest/longest path; all-pairs shortest path; dynamic
programming; linear-programming; non-linear programming; and backtracking.
•Introduction to Physical Design
•Supply Network Design
Late home work will not be accepted
Two in-class, open-book exams, each 20%
Requires people to work in groups of two
1. No “Incomplete” grades will be given for the course, except
under very extreme circumstances.
2. You are not permitted to submit extra work in an attempt
to raise your grade.
3. You are responsible for all assigned readings and
information presented in class, including due dates, assignments, exams and so
forth. Moreover, you are expected to attend all class meetings.
4. Scholastic misconduct will not be tolerated. Scholastic dishonesty includes, but is not limited to: cheating on assignments or exams; plagiarizing; or interfering with another student’s work.