schedule

Schedule for ESE 556
Spring 2003

Week Tuesday Thursday

1)                01/22-01/26

VLSI Physical Design Automation: VLSI design cycle, physical design cycle, design styles, packaging, multichip modules.
Design and fabrication of VLSI chips: design rules, layout of basic cells, scalling, performances (timing, area, power consumption, noise & crosstalk).

2)                01/27-02/02 Basic data structures & algorithms.
Partitioning: problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search. Partitioning: problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search. (Project 1 is handed over).

3)                02/03-02/09 Partitioning: problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search. Placement and floorplanning: problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.

4)                02/10-02/16 Placement and floorplanning: problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning. Placement and floorplanning: problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning.

5)                02/17-02/23 Placement and floorplanning: problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning. No class.

6)                02/24-03/02 Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. (Project 2 is handed over). Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.

7)                03/03-03/09 Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. Midterm 1

8)                03/10-03/16 Detailed routing: problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms. Detailed routing: problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms.

9)                03/24-03/30 Specialized routing: clock routing, power and ground routing. Floorplanning, placement and routing for analog and mixed-signal designs.

10)              03/31-04/06 Floorplanning, placement and routing for analog and mixed-signal designs.
(Project 3 is handed over). Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.

11)              04/07-04/13 Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding. Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. (Project 3 is handed over).

12)              04/14-04/20 Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. No classes in session

13)              04/21-04/27 Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods. Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.

14)              04/28-05/04 Cell-library binding: problem formulation, algorithms for library binding. Cell-library binding: problem formulation, algorithms for library binding.

15)              05/05-05/07 Research problems in logic-level CAD Research problems in logic-level CAD

Week	Tuesday	Thursday
1) *01/22-01/26*		*VLSI Physical Design Automation: VLSI design cycle, physical design cycle, design styles, packaging, multichip modules. Design and fabrication of VLSI chips*: design rules, layout of basic cells, scalling, performances (timing, area, power consumption, noise & crosstalk).
2) *01/27-02/02*	*Basic data structures & algorithms. Partitioning:* problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.	*Partitioning:* problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search. (Project 1 is handed over).
3) *02/03-02/09*	*Partitioning:* problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.	*Placement and floorplanning:* problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.
4) *02/10-02/16*	*Placement and floorplanning:* problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.	*Placement and floorplanning:* problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning.
5) *02/17-02/23*	*Placement and floorplanning:* problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning.	*No class.*
6) *02/24-03/02*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. *(Project 2 is handed over).*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.
7) *03/03-03/09*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.	Midterm 1
8) *03/10-03/16*	*Detailed routing:* problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms.	*Detailed routing:* problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms.
9) *03/24-03/30*	*Specialized routing:* clock routing, power and ground routing.	*Floorplanning, placement and routing for analog and mixed-signal designs.*
10) *03/31-04/06*	*Floorplanning, placement and routing for analog and mixed-signal designs.* (Project 3 is handed over).	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.
11) *04/07-04/13*	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.	Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. (Project 3 is handed over).
12) *04/14-04/20*	Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization.	*No classes in session*
13) *04/21-04/27*	Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.	Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.
14) *04/28-05/04*	Cell-library binding: problem formulation, algorithms for library binding.	Cell-library binding: problem formulation, algorithms for library binding.
15) *05/05-05/07*	*Research problems in logic-level CAD*	*Research problems in logic-level CAD*