Topological routing using geometric information
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A novel method is proposed for the two-layer topological channel routing problem. The authors' algorithm takes geometric information into consideration when a topological solution is obtained. Experimental results show that the algorithm generates very good solutions. For example, the authors have obtained a height of 41 for Deutsch's difficult example without any parallel overlaps of wires while simultaneously achieving a via count of 219.Keywords
This publication has 7 references indexed in Scilit:
- Improved channel routing by via minimization and shiftingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Topological channel routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Geometrical compaction in one dimension for channel routingPublished by Association for Computing Machinery (ACM) ,1987
- An Unconstrained Topological Via Minimization Problem for Two-Layer RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- A “greedy” channel routerPublished by Association for Computing Machinery (ACM) ,1982