Referenced Items are not available for this document.
This paper proposes a new layer assignment algorithm for constrained via minimization in VLSI chip design. The new algorithm uses an intersect graph model and applies a pseudo two coloring technique in order to find near optimal layer assignments in two layers. The pseudo two coloring problem is known to be NP-complete in the general case but a polynomial solution exists for planar graphs. This paper compares the proposed algorithm to optimal results produced in planar and nonplanar graphs as well as to another recent two coloring heuristic in random graphs. The paper also discusses the possibility of extending the algorithm to mutilayers
Published in:
Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
(Volume:1
)
Date of Conference: 3-5 Aug 1994
- Page(s):
- 363 - 366 vol.1
- Meeting Date :
- 03 Aug 1994-05 Aug 1994
- Print ISBN:
- 0-7803-2428-5
- INSPEC Accession Number:
- 5131076
- Conference Location :
- Lafayette, LA
- Digital Object Identifier :
- 10.1109/MWSCAS.1994.519257
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
