By Topic

On locally optimal breaking of complex cyclic vertical constraints in VLSI channel routing

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

1 Author(s)
A. D. Johnson ; Dept. of Electr. Eng. & Comput. Sci., Toledo Univ., OH, USA

Existing theory has supported deterministic polynomial time procedures for locally optimal breaking (LOB) of two classes of directed circuits (DC) in the vertical constraint graph, the classes of vertex disjoint DCs, and of couples of connected DCs. New LOB theory is reported that supports procedures for LOB of any number of DCs sharing a common vertex, or a common path, and of DCs in uniform ladder VCGs. A significant aspect of the new theory is that it relies on procedures for couples of connected DCs as tools for breaking more complex structures of connected DCs. Application of the theory in genetic channel routers is reported elsewhere

Published in:

VLSI, 1996. Proceedings., Sixth Great Lakes Symposium on

Date of Conference:

22-23 Mar 1996