This research is on algorithmic approaches to VLSI, and four problems are being investigated. These are: 1. Literal minimization in logic synthesis using an approach based on term intersection graphs. 2. Gate level placement problems using minimum floating Steiner trees. 3. Budget assignment in timing driven placement in which a novel optimization tool is being explored. 4. Clock tree design using a gated design which minimizes activity, hence power consumption. A coherent design system, incorporating above stages, is being developed.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9527389
Program Officer
Robert B Grafton
Project Start
Project End
Budget Start
1996-02-01
Budget End
2000-01-31
Support Year
Fiscal Year
1995
Total Cost
$199,768
Indirect Cost
Name
Northwestern University at Chicago
Department
Type
DUNS #
City
Evanston
State
IL
Country
United States
Zip Code
60201