Algorithms for the layout problem in VLSI design automation
Thesis/Dissertation
·
OSTI ID:5520203
As improvements in VLSI technology make it possible to pack an increasingly large number of components on a silicon chip, it becomes more important to automate the design of integrated circuits. One of the most important problems in VLSI design automation is the layout problem. This problem is extremely difficult. A typical VLSI layout system tackles the problem by the divide-and-conquer strategy. Here, two problems are studied, namely: the channel-partition problem and the channel routing problem, arising from this approach. Since both of these problems are computationally intractable, a collection of efficient approximation algorithms, to solve them is presented. It is shown that all of the algorithms generate solutions with objective function values close to optimal
- Research Organization:
- California Univ., Santa Barbara, CA (USA)
- OSTI ID:
- 5520203
- Country of Publication:
- United States
- Language:
- English
Similar Records
Compaction-based VLSI layout
Algorithms for VLSI layout
Automated routing method for VLSI with three interconnection layers
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6223173
Algorithms for VLSI layout
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5501454
Automated routing method for VLSI with three interconnection layers
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6624895