Referenced Items are not available for this document.
We describe a new linear programming (LP)-based hierarchical pitchmatching method. With a simplified treatment of the intercell constraints, the size of the LP problems is significantly reduced as compared to the best known results. In particular, the pitchmatching problem is decomposed into independent subproblems by exploiting the layout slicing structure. Each subproblem is further “folded” to reduce the LP problem size. We prove that the new method generates smaller LP problem than the previously best known approach. Experimental data show that the LP problem size can be 10 times smaller
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:14
,
Issue:
4
)
Date of Publication: Apr 1995
- Page(s):
- 523 - 526
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 4934848
- Digital Object Identifier :
- 10.1109/43.372379
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Apr 1995
- Sponsored by :
- IEEE Council on Electronic Design Automation
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.
