Full metadata record
DC FieldValueLanguage
dc.contributor.authorShew, PWen_US
dc.contributor.authorHsiao, PYen_US
dc.date.accessioned2014-12-08T15:01:58Z-
dc.date.available2014-12-08T15:01:58Z-
dc.date.issued1997-03-01en_US
dc.identifier.issn1350-2387en_US
dc.identifier.urihttp://dx.doi.org/10.1049/ip-cdt:19971157en_US
dc.identifier.urihttp://hdl.handle.net/11536/698-
dc.description.abstractThe authors present a new routing model for over-the-cell channel routing. A graph theoretical algorithm is then proposed to solve the new problem, The algorithm has a complexity of O(nk(2)), where n is the number of nets and k is the number of columns in the channel. It achieved a routing area reduction of 71.5% for the PRIMARY 1 benchmark example from MCNC, using three-layer over-the-cell routing. To resolve a sub-problem, the authors also present an O(m nu) algorithm to find the maximum weight independent chord set in a circle graph with m chords incident to nu vertices, where two chords may share a common vertex.en_US
dc.language.isoen_USen_US
dc.subjectover-the-cell routingen_US
dc.subjectmaximum weight independent chord seten_US
dc.subjectcircle graphen_US
dc.subjectVLSIen_US
dc.titlePlanar constrained terminals over-the-cell routeren_US
dc.typeArticleen_US
dc.identifier.doi10.1049/ip-cdt:19971157en_US
dc.identifier.journalIEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUESen_US
dc.citation.volume144en_US
dc.citation.issue2en_US
dc.citation.spage121en_US
dc.citation.epage126en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
Appears in Collections:Articles


Files in This Item:

  1. A1997XC46300009.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.