Please use this identifier to cite or link to this item: https://doi.org/10.1049/ip-cdt:19971157
DC FieldValue
dc.titlePlanar constrained terminals over-the-cell router
dc.contributor.authorShew, P.W.
dc.contributor.authorHsiao, P.-Y.
dc.date.accessioned2016-12-19T06:47:58Z
dc.date.available2016-12-19T06:47:58Z
dc.date.issued1997-03
dc.identifier.citationShew, P.W., Hsiao, P.-Y. (1997-03). Planar constrained terminals over-the-cell router. IEE Proceedings: Computers and Digital Techniques 144 (2) : 121-126. ScholarBank@NUS Repository. https://doi.org/10.1049/ip-cdt:19971157
dc.identifier.issn13502387
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/133191
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(nk2), 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(mv) algorithm to find the maximum weight independent chord set in a circle graph with m chords incident to v vertices, where two chords may share a common vertex.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1049/ip-cdt:19971157
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.doi10.1049/ip-cdt:19971157
dc.description.sourcetitleIEE Proceedings: Computers and Digital Techniques
dc.description.volume144
dc.description.issue2
dc.description.page121-126
dc.description.codenICDTE
dc.identifier.isiutA1997XC46300009
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

WEB OF SCIENCETM
Citations

1
checked on Aug 16, 2019

Page view(s)

24
checked on Aug 16, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.