Topological channel routing (VLSI)
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (10) , 1177-1197
- https://doi.org/10.1109/43.170984
Abstract
A VLSI two-layer channel router designed to find solutions which minimize both wiring area and number of vias simultaneously is presented. The method, called topological channel routing, analyzes the topological relationship of wires before the wires are mapped onto the channel. A unique layout design rule called an interleaving mesh is used. The interleaving mesh prohibits long wires on one layer from overlapping with wires on the other layer, and thus has smaller crosstalk of signals because of smaller capacitive couplings between those wires on different layers. Experimental results show that the algorithm generates very good solutions. For example, a height of 41 for Deutsch's Difficult Example without any parallel overlaps of wires has been obtained and simultaneously, with a via count of 186, which is one of the best results ever reported in the literatureKeywords
This publication has 21 references indexed in Scilit:
- Improved channel routing by via minimization and shiftingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Topological routing using geometric informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- VIA minimization by layout modificationPublished by Association for Computing Machinery (ACM) ,1989
- Finding a Maximum Planar Subset of a Set of Nets in a ChannelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Via minimization for gridless layoutsPublished 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
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- Virtual Grid Symbolic LayoutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971