Thomborson The theory underlying optimal adder design and global wire routing is well understood, so the focus is on implementation issues. Experimental software is being developed to determine optimal adders. Attention is being paid to tradeoffs between the smallest area, fastest, and least power adders. The feasibility of using large linear programs to solve the problem of routing wires on chips and modules is being investigated. Theoretical work is on the problem of finding minimum length tree shaped interconnections (Steiner trees) among a set of terminals on a VLSI chip. Rendering grey-scale images on a monochrome display terminal or laser printer is being explored. Algorithms, amenable to speedup on parallel or pipelined computers, are sought.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9023238
Program Officer
Robert B Grafton
Project Start
Project End
Budget Start
1991-05-15
Budget End
1995-04-30
Support Year
Fiscal Year
1990
Total Cost
$188,757
Indirect Cost
Name
University of Minnesota Twin Cities
Department
Type
DUNS #
City
Minneapolis
State
MN
Country
United States
Zip Code
55455