schedule

Schedule for ESE 556
Spring 2004

Week Tuesday Thursday

1)               01/26-01/01
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.
Partitioning: problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.

2)               02/02-02/08 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.

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

4)               02/16-02/22 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/23-02/29 Global routing: problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. Out of town.

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

7)               03/08-03/14 Detailed routing: problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms. Midterm 1

8)               03/15-03/21 Detailed routing: problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms. Floorplanning, placement and routing for analog and mixed-signal designs. Specialized routing: clock routing, power and ground routing.

9)               03/22-03/28 Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding. Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.

10)             03/29-04/04 Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.
Two-level combinational logic optimization: logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.

11)             04/05-04/11 Spring break Spring break

12)             04/12-04/18 Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. (Project 2 is due).(Project 3 is handed over). Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization.

13)             04/19-04/25 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/26-05/02 Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods. Cell-library binding: problem formulation, algorithms for library binding.

15)              05/03-05/09 Cell-library binding: problem formulation, algorithms for library binding. Cell-library binding: problem formulation, algorithms for library binding. (Project 3 is due)

Week	Tuesday	Thursday
1) *01/26-01/01*	*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. Partitioning:* problem formulation, Kernighan-Lin algorithm, Fiduccia-Mattheyses algorithm, simulated annealing, tabu search.
2) *02/02-02/08*	*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.
3) *02/09-02/15*	*Placement and floorplanning:* problem formulation, simulation based placement, partitioning based placement, quadratic assignement, branch-and-bound techniques, integer programming based floorplanning.	*Placement and floorplanning:* problem formulation, partitioning based placement, quadratic assignement, branch-and-bound techniques, iterative placement, integer programming based floorplanning.
4) *02/16-02/22*	*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/23-02/29*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.	Out of town.
6) *03/01-03/07*	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms. (Project 1 is due) (Project 2 is handed over).	*Global routing:* problem formulation, maze routing algorithms, Steiner tree based algorithms, integer programming based algorithms.
7) *03/08-03/14*	*Detailed routing:* problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms.	Midterm 1
8) *03/15-03/21*	*Detailed routing:* problem formulation, single-layer routing algorithms, two-layer channel routing algorithms, multi-layer channel routing algoithms, switchbox routing algorithms.	*Floorplanning, placement and routing for analog and mixed-signal designs. Specialized routing:* clock routing, power and ground routing.
9) *03/22-03/28*	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.
10) *03/29-04/04*	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.	*Two-level combinational logic optimization:* logic optimization principles, operations on two-level logic covers, algorithms for logic minimization, symbolic minimization and encoding.
11) *04/05-04/11*	Spring break	Spring break
12) *04/12-04/18*	Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization. (Project 2 is due).(Project 3 is handed over).	Multi-level combinational logic optimization: models and transformations for combinational networks, algebraic model, boolean model, allgorithms for delay evaluation and optimization.
13) *04/19-04/25*	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/26-05/02*	Sequential logic optimization: sequential circuit optimization using state-based models, sequential circuit optimization using network models, implicit finite-state machine traversal methods.	Cell-library binding: problem formulation, algorithms for library binding.
15) *05/03-05/09*	Cell-library binding: problem formulation, algorithms for library binding.	Cell-library binding: problem formulation, algorithms for library binding. (Project 3 is due)