Obstacle-avoiding rectilinear Steiner tree.

Li, Liang. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. === Includes bibliographical references (leaves 57-61). === Abstract also in Chinese. === Abstract --- p.i === Acknowledgement --- p.iv === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Background --- p.1 === Chapte...

Full description

Bibliographic Details
Other Authors: Li, Liang.
Format: Others
Language:English
Chinese
Published: 2009
Subjects:
Online Access:http://library.cuhk.edu.hk/record=b5894012
http://repository.lib.cuhk.edu.hk/en/item/cuhk-326850
Description
Summary:Li, Liang. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. === Includes bibliographical references (leaves 57-61). === Abstract also in Chinese. === Abstract --- p.i === Acknowledgement --- p.iv === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Background --- p.1 === Chapter 1.1.1 --- Partitioning --- p.1 === Chapter 1.1.2 --- Floorplanning and Placement --- p.2 === Chapter 1.1.3 --- Routing --- p.2 === Chapter 1.1.4 --- Compaction --- p.3 === Chapter 1.2 --- Motivations --- p.3 === Chapter 1.3 --- Problem Formulation --- p.4 === Chapter 1.3.1 --- Properties of OARSMT --- p.4 === Chapter 1.4 --- Progress on the Problem --- p.4 === Chapter 1.5 --- Contributions --- p.5 === Chapter 1.6 --- Thesis Organization --- p.6 === Chapter 2 --- Literature Review on OARSMT --- p.8 === Chapter 2.1 --- Introduction --- p.8 === Chapter 2.2 --- Previous Methods --- p.9 === Chapter 2.2.1 --- OARSMT --- p.9 === Chapter 2.2.2 --- Shortest Path Problem with Blockages --- p.13 === Chapter 2.2.3 --- OARSMT with Delay Minimization --- p.14 === Chapter 2.2.4 --- OARSMT with Worst Negative Slack Maximization --- p.14 === Chapter 2.3 --- Comparison --- p.15 === Chapter 3 --- Heuristic Method --- p.17 === Chapter 3.1 --- Introduction --- p.17 === Chapter 3.2 --- Our Approach --- p.18 === Chapter 3.2.1 --- Handling of Multi-pin Nets --- p.18 === Chapter 3.2.2 --- Propagation --- p.20 === Chapter 3.2.3 --- Backtrack --- p.23 === Chapter 3.2.4 --- Finding MST --- p.26 === Chapter 3.2.5 --- Local Refinement Scheme --- p.26 === Chapter 3.3 --- Experimental Results --- p.28 === Chapter 3.4 --- Summary --- p.28 === Chapter 4 --- Exact Method --- p.32 === Chapter 4.1 --- Introduction --- p.32 === Chapter 4.2 --- Review on GeoSteiner --- p.33 === Chapter 4.3 --- Overview of our Approach --- p.33 === Chapter 4.4 --- FST with Virtual Pins --- p.34 === Chapter 4.4.1 --- Definition of FST --- p.34 === Chapter 4.4.2 --- Notations --- p.36 === Chapter 4.4.3 --- Properties of FST with Virtual Pins --- p.36 === Chapter 4.5 --- Generation of FST with Virtual Pins --- p.46 === Chapter 4.5.1 --- Generation of FST with Two Pins --- p.46 === Chapter 4.5.2 --- Generation of FST with 3 or More Pins --- p.48 === Chapter 4.6 --- Concatenation of FSTs with Virtual Pins --- p.50 === Chapter 4.7 --- Experimental Results --- p.52 === Chapter 4.8 --- Summary --- p.53 === Chapter 5 --- Conclusion --- p.55 === Bibliography --- p.61