A Dogleg "Optimal" Channel Router with Completion Enhancements
- 1 January 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 762-768
- https://doi.org/10.1109/dac.1981.1585443
Abstract
Routing algorithms have been developed for use in automatic Integrated Circuit (IC) layout programs. The algorithms address the following issues: (1) completion enhancements to eliminate cyclic constraints and achieve 100 percent routing completion, although possibly sacrificing optimality; (2) a dogleg "optimal" channel router which allows more than one horizontal segment per net and uses a branch and bound method to find a minimal routing for the given set of nets; and (3) shortcut techniques to reduce the amount of time spent using the branch and bound method.Keywords
This publication has 4 references indexed in Scilit:
- An optimum channel-routing algorithm for polycell layouts of integrated circuitsPublished by Association for Computing Machinery (ACM) ,1988
- Placement Algorithms for Arbitrarily Shaped BlocksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971