Please use this identifier to cite or link to this item:
|Title:||Planar constrained terminals over-the-cell router|
|Authors:||Shew, P.W. |
|Citation:||Shew, 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|
|Abstract:||The 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.|
|Source Title:||IEE Proceedings: Computers and Digital Techniques|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
WEB OF SCIENCETM
checked on Sep 3, 2018
checked on Sep 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.