Routing algorithms in the physical design of VLSI circuits
Thesis/Dissertation
·
OSTI ID:6103949
In this thesis, the author solves several important routing problems in the physical design of VLSI circuits. He successfully applies combinatorial optimization techniques to these problems and obtains very effective and efficient algorithms. The experimental results presented in this thesis show that these algorithms produce high quality routing solutions on a wide range of test circuits using reasonable amount of computation time. Chapter 2 and 3 addresses some global routing problems in the physical design of VLSI circuits. In Chapter 2, he presents a global routing algorithm for standard cell design which connects all the nets in parallel. He shows that only a linear number of possible connections need to be considered by his algorithm. In Chapter 3, he presents an algorithm which combines the pin assignment step and the global routing step in the general cell design style. The complexity of the combined problem is reduced based on the block boundary decomposition. In Chapter 4 and 5, he studies some detailed routing problems. In Chapter 4, he shows how to enhance channel compaction results by modifying the initial grid-based routing solution. He shows that proper track permutation and local re-routing leads to significant reduction in channel routing area. In Chapter 5, he studies a new channel routing model called over-the-cell channel routing. He shows that the over-the-cell routing problem can be solved in three steps and presents efficient solutions to the sub-problems at each step. In Chapter 6, he studies the planar subset problem and the topological via minimization in multi-layer routing models. He shows that the general problems are NP-hard and gives efficient solutions to the restricted problems.
- Research Organization:
- Illinois Univ., Urbana, IL (United States)
- OSTI ID:
- 6103949
- Country of Publication:
- United States
- Language:
- English
Similar Records
Algorithms for VLSI routing. [Very Large Scale Integration, semiconductor chip design]
Automated routing method for VLSI with three interconnection layers
Algorithms for the layout problem in VLSI design automation
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6043677
Automated routing method for VLSI with three interconnection layers
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6624895
Algorithms for the layout problem in VLSI design automation
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5520203
Related Subjects
42 ENGINEERING
426000* -- Engineering-- Components
Electron Devices & Circuits-- (1990-)
99 GENERAL AND MISCELLANEOUS
990200 -- Mathematics & Computers
ALGORITHMS
COMPUTER-AIDED DESIGN
DATA ANALYSIS
DESIGN
ELECTRONIC CIRCUITS
MATHEMATICAL LOGIC
MATHEMATICS
MICROELECTRONIC CIRCUITS
OPTIMIZATION
ROUTING
TOPOLOGY
426000* -- Engineering-- Components
Electron Devices & Circuits-- (1990-)
99 GENERAL AND MISCELLANEOUS
990200 -- Mathematics & Computers
ALGORITHMS
COMPUTER-AIDED DESIGN
DATA ANALYSIS
DESIGN
ELECTRONIC CIRCUITS
MATHEMATICAL LOGIC
MATHEMATICS
MICROELECTRONIC CIRCUITS
OPTIMIZATION
ROUTING
TOPOLOGY