Efficient over-cell routing method for transparent standard cells

In this paper a new routing method for transparent standard cells is presented. The method enlarges the original netlist to allow for the optimal application of bipartite graphs matching. This routing approach aims to reduce the number of tracks used in the routing channels and thus delivers better...

Full description

Saved in:
Bibliographic Details
Published in38th Midwest Symposium on Circuits and Systems. Proceedings Vol. 2; pp. 795 - 798 vol.2
Main Authors Wolf, H.G., Doerffer, K., Mlynski, D.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this paper a new routing method for transparent standard cells is presented. The method enlarges the original netlist to allow for the optimal application of bipartite graphs matching. This routing approach aims to reduce the number of tracks used in the routing channels and thus delivers better results as previously published methods. This is achieved by maximization of strictly vertical routing segments, which are used for interconnections between terminals of a multi-terminal net conduced in different cell rows. The problem of finding the strictly vertical routing segments is formulated as a matching problem in a bipartite graph. During the routing phase the netlist is enlarged by supplementary terminals to increase the maximum matching cardinality. The here described method can be applied to over-cell routing independently of the used design style.
ISBN:9780780329720
0780329724
DOI:10.1109/MWSCAS.1995.510208