CaltechAUTHORS
Published 1983 | Version public
Book Section - Chapter Metadata-only

A New Channel Routing Algorithm

Creators

Contributors

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

© 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.

Additional details

Identifiers

Eprint ID
54263
Resolver ID
CaltechAUTHORS:20150130-160600750

Dates

Created
2015-02-04
Created from EPrint's datestamp field
Updated
2019-10-03
Created from EPrint's last_modified field