Published September 1982
| public
Report
Open
A new channel routing algorithm
- Creators
- Chan, Wan S.
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.
Additional Information
The research was carried out during the author's tenure as a Hewlett-Packard representative at Caltech Silicon Structures Project.Files
TM_5038.pdf
Files
(6.2 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:63ac93b1d97712e94ddfd5331fd03d6b
|
6.2 MB | Preview Download |
Additional details
- Eprint ID
- 30219
- Resolver ID
- CaltechAUTHORS:20120420-103600164
- Created
-
2012-05-02Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Other Numbering System Name
- Computer Science Technical Memorandum
- Other Numbering System Identifier
- 5038