ECE 665 Paper Presentations

ECE 665 Paper Presentations - Spring 2005

Paper Presentations are mandatory for all Ph.D. students taking the course.
Each Ph.D. student must prepare a 25 minute presentation, conference style, with power-point slides, to be delivered in class. The presentations are planned for the week of April 19.

Suggested Presentation Topics

The best source for papers are conferences in Coputer Aided Design, such as ICCAD, DAC, and DATE, available on SIGDA Proceeding Archives. Other sources for CAD papers, including TODAES journal, is SIGDA web site.

The following slides are taken from the textbook, selected papers and recent conference presentations. They illustrate interesting problems that can be solved using graph algorithms and mathematical programming.

Fundamental Algorithms

Bipartitioning , a fundamental bi-partitioning algorithm of Kernighan-Lin.
Simulated Annealing , a generic method for solving discrete optimization problems.
Fast Fourier Transform , an efficient algorithm to compute Discrete Fourier Transform.

Physical Design Automation (placement, routing, floorplanning, layout).

Gate matrix Layout generation: slides-layout.
Min-cost flow-based Routing for FPGAs: paper-5D2, ICCAD-03 slides-5D2.
Recursive bisection Placement using fractional cut: paper-4D2, ICCAD-03 slides-4D2.
Bus-driven Floorplanning: paper-1D1, ICCAD-03 slides-1D1.
Cross-talk Minimization in Multilevel routing: paper-5D1, ICCAD-03.

High Level Synthesis

Optimizing Resource Binding in HLS: paper-1C3, ICCAD-03 slides-1C3.
Binding, Allocation and Floorplanning in High-level Synthesis: paper-7C3, ICCAD-03 slides-7C3.
Gradual Relaxation Techniques for Behavioral Synthesis: paper-7C1, ICCAD-03 slides-7C1.