Course outline: 1. Introduction History, VLSI design flow, etc. 2. Basics of Computation Theory and Mathematical Optimization 3. Models of computation Finite state machine, finite automata, Kahn process network, Petri net, neural network, etc. 4. High-level synthesis Design space exploration, resource sharing, etc. 5. Logic synthesis Technology independent optimization, technology mapping, technology dependent optimization, timing and power analysis, etc. 6. Verification Combinational and sequential equivalence checking, property checking, etc. 7. Physical design Floorplanning, placement, routing, etc. 8. Testing Combinational and sequential ATPG, design for test, etc. 9. Advanced topics Neural network synthesis, quantum circuit synthesis and simulation, etc.

Electronic Design Automation (EDA) concerns the correctness, reliability, productivity, and optimization of system construction. It is an interdisciplinary field, where electrical engineering and computer sciences intersect. In EDA, computer science methods (including algorithms, complexity, automata, logic, programming languages, etc.) finds rich and practical applications. On the other hand, some of the techniques developed in the EDA community have been much enhanced the state-of-the-art solvers on intractable computation problems in computer science. In this course we will study some representative problems and solutions making VLSI design an automatic process. In particular, we will cover system modeling, optimization, analysis, and verification.

Prerequisite: Switching circuits and logic design

Textbook： Electronic Design Automation: Synthesis, Verification, and Test, Laung-Terng Wang, Kwang-Ting (Tim) Cheng, and Yao-Wen Chang, editors, Morgan Kaufmann Publishers, 2009.