Scribd
Upload
1 views

lecture1

The course 'Algorithms for VLSI Design Automation' covers algorithms related to VLSI physical design, verification, and high-level synthesis, with a focus on problem modeling and computational complexity. Grading is based on homework, reading assignments, a midterm project, and a final project, with class participation being mandatory. The course utilizes a textbook by N. Sherwani and references several additional resources for further study.

Uploaded by

Sunanda Pandit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
1 views

lecture1

The course 'Algorithms for VLSI Design Automation' covers algorithms related to VLSI physical design, verification, and high-level synthesis, with a focus on problem modeling and computational complexity. Grading is based on homework, reading assignments, a midterm project, and a final project, with class participation being mandatory. The course utilizes a textbook by N. Sherwani and references several additional resources for further study.

Uploaded by

Sunanda Pandit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Algorithms for VLSI Design Automation

Algorithms for VLSI Design Automation


(EE -6375 CAD ALGORITHMS, Fall 2004)

Instructor D. Zhou
[email protected]
Phone: 972 883 4392
Office: ECN 4.610

This course focuses on the algorithms occurred in VLSI design automation.


It addresses the typical issues related to VLSI physical design, verification, and
high-level synthesis.

Text book: N. Sherwani, “Algorithms for VLSI Physical Design,” Kluwer Academic
Publishers, 1999.

Time and class room: TR 8:30-9:45PM, ECSN 2.110

Dr. , E.E. Department, UTD Page 1 5/29/2025


Algorithms for VLSI Design Automation

Topics

1. Introduction to VLSI design automation

1.1 Introduction to VLSI design

1.2 CAD (or EDA) tools

1.3 Problem modeling

1.4 Introduction to algorithms

1.5 Computational complexity

2. Physical design

2.1 Routing

2.2 Interconnect circuit order reduction

2.3 Buffer sizing and insertion

Dr. , E.E. Department, UTD Page 2 5/29/2025


Algorithms for VLSI Design Automation

2.4 Clock signal distribution

2.5 Power network simulation

2.6 Floor plan and placement

3. Verification

3.1 Equivalent checking

3.2 SAT problem

3.3 Integer programming

4. High-level synthesis

4.1 Scheduling

4.2 Resource allocation

Grading policy

Dr. , E.E. Department, UTD Page 3 5/29/2025


Algorithms for VLSI Design Automation

Homework ->15%, reading assignment ->15%, middle term project ->30%,


and final project ->40%.

85-100 ->A, 70-84 ->B, 60-69 ->C, below 60 ->F.

Class Participation

Class participation is required. If you can not attend the class, please obtain
the permission from the instructor in advance.

Reference

1. T. H. Cormen and etc., “Introduction to Algorithms,” McGraw-Hill, 2001.

2. M. R. Garey and D. S. Hohnson, “Computers and Intractability,” W. H.


Freeman and Company, 1979.

3. S. M. Rubin, “Computer Aids for VLSI Design,” Addison-Wesley, 1987.

4. W. Wolf, “Modern VLSI design,” Prentice Hall, 2002.

Dr. , E.E. Department, UTD Page 4 5/29/2025


Algorithms for VLSI Design Automation

5. N. Weste and K. Eshraghian, “Principles of CMOS Design,” Addison-Wesley


Publishing Company, 1993.

6. T. Lengauer, “Combinatorial Algorithm for Integrated Circuit Layout,” John


Wiley & Sons, 1990.

7. B. Preas and M. Lorenzetti, “Physical Design Automation of VLSI Systems,”


The Benjamin/Cummings Publishing Company, 1988.

8. Proceedings of DAC, ICCAD, DATE, and ISCAS.

9. IEEE Transactions on CAD, VLSI, and CAS.

Dr. , E.E. Department, UTD Page 5 5/29/2025

You might also like