Open Access Open Access  Restricted Access Subscription or Fee Access

The Algorithm and Application Based on Graphs for the Symmetrical Routing

Zhenghua Xu

Abstract



Routing is a very important step in the automatic layout design of VLSI circuits. We often consider the routing for some special nets under the restrictions, such as equidistance and symmetry. When the symmetrical routing is needed, the routing is often finished by hand. The manual wiring can only solve the routing where layers and nets are less. The symmetrical routing problem is equivalent to finding a Steiner tree of the corresponding vertices for all of the pins in the valid connected graph. We put forward an algorithm for the symmetrical routing and provide a method and the theory based on graphs for the automation software of the symmetrical routing.

Keywords


Integrated circuit, routing, graph, Steiner tree.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.