By Topic

Efficient over-cell routing method for transparent standard cells

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. G. Wolf ; Inst. fur Theor. Elektrotech. & Messtech., Karlsruhe Univ., Germany ; K. Doerffer ; D. A. Mlynski

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

Published in:

Circuits and Systems, 1995., Proceedings., Proceedings of the 38th Midwest Symposium on  (Volume:2 )

Date of Conference:

13-16 Aug 1995