Referenced Items are not available for this document.
The author addresses the minimum density switchable segment assignment (MINDESSA) problem, which arises during the global routing of standard cell integrated circuits. A switchable segment is a portion of a net that can be routed in one of two adjacent channels. The MINDESSA problem is the problem of assigning switchable segments to one of the two possible channels so that the total channel density of the IC is minimized. The author presents an algorithm for calculating a lower bound on channel density for the MINDESSA problem
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:8
,
Issue:
5
)
Date of Publication: May 1989
- Page(s):
- 574 - 577
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 3442043
- Digital Object Identifier :
- 10.1109/43.24886
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1989
- 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.
