schedule

Schedule for ESE 556
Spring 2006

Week Tuesday Thursday

1)                01/23-01/29 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). Basic data structures & algorithms .

2)                01/30-02/05 Basic data structures & algorithms .
Basic data structures & algorithms .

3)                02/06-02/012 Partitioning: problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.(Project 1 is handed over). Partitioning:problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.

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

5)                02/20-02/26 Placement and floorplanning: problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning. (Project 2 is handed over) Placement and floorplanning: problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.

6)                02/27-03/05 Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. . Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.

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

8)                03/13-03/19 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/20-03/26 Specialized routing: clock routing, power and ground routing. (Project 3 is handed over). Floorplanning, placement and routing for analog and mixed-signal designs.

10)              03/27-04/02 Floorplanning, placement and routing for analog and mixed-signal designs.

Two-level combinational logic optimization : logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.

11)              04/03-04/09 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.

12)              04/17-04/23 Multi-level combinational logic optimization : models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. Sequential logic optimization : sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.

13)              04/24-04/30 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)              05/01-05/07 Cell-library binding: problem formulation, algorithms for library binding. Cell-library binding: problem formulation, algorithms for library binding.

Week	Tuesday	Thursday
1) *01/23-01/29*	*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).	*Basic data structures & algorithms* .
2) *01/30-02/05*	*Basic data structures & algorithms* .	*Basic data structures & algorithms* .
3) *02/06-02/012*	*Partitioning:* problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.(Project 1 is handed over).	*Partitioning:*problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.
4) *02/13-02/19*	*Partitioning:*problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.	*Placement and floorplanning:* problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning.
5) *02/20-02/26*	*Placement and floorplanning:* problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning. *(Project 2 is handed over)*	*Placement and floorplanning:* problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.
6) *02/27-03/05*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. .	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.
7) *03/06-03/12*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.	Midterm exam
8) *03/13-03/19*	*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/20-03/26*	*Specialized routing:* clock routing, power and ground routing. (Project 3 is handed over).	*Floorplanning, placement and routing for analog and mixed-signal designs.*
10) *03/27-04/02*	*Floorplanning, placement and routing for analog and mixed-signal designs.*	*Two-level combinational logic optimization :* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.
11) *04/03-04/09*	*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.
12) *04/17-04/23*	Multi-level combinational logic optimization : models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization.	Sequential logic optimization : sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.
13) *04/24-04/30*	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) *05/01-05/07*	Cell-library binding: problem formulation, algorithms for library binding.	Cell-library binding: problem formulation, algorithms for library binding.