Chan, Wan S. (1983) A New Channel Routing Algorithm. In: Third Caltech Conference on Very Large Scale Integration. Computer Science Press , Rockville, Md, pp. 117-139. ISBN 0914894862. https://resolver.caltech.edu/CaltechAUTHORS:20150130-160600750
Full text is not posted in this repository.
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150130-160600750
Abstract
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: | Book Section |
|---|---|
| Additional Information: | © 1983 Computer Science Press. This work was carried out during the author's tenure as a visiting associate representing Hewlett- Packard at the Silicon Structures Project in California Institute of Technology. The author wishes to express his sincere gratitude to HP and SSP for providing an excellent research environment. |
| Record Number: | CaltechAUTHORS:20150130-160600750 |
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20150130-160600750 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 54263 |
| Collection: | CaltechAUTHORS |
| Deposited By: | INVALID USER |
| Deposited On: | 04 Feb 2015 04:17 |
| Last Modified: | 03 Oct 2019 07:56 |
Repository Staff Only: item control page
