Chan, Wan S. (1982) A new channel routing algorithm. California Institute of Technology , Pasadena, CA. http://resolver.caltech.edu/CaltechAUTHORS:20120420-103600164
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120420-103600164
This paper presents a new algorithm for solving the two-layer channel routing problem with doglegging. Based on a set of intuitive and reasonable heuristics, the algorithm tries to obtain a channel routing configuration with a minimum number of tracks. For every benchmark problem tested, the algorithm gives a routing configuration with the smallest number of tracks reported in the literature.
|Item Type:||Report or Paper (Technical Report)|
|Additional Information:||The research was carried out during the author's tenure as a Hewlett-Packard representative at Caltech Silicon Structures Project.|
|Group:||Computer Science Technical Reports|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||02 May 2012 17:55|
|Last Modified:||26 Dec 2012 15:05|
Repository Staff Only: item control page