Planar constrained terminals over-the-cell router
| dc.citation.epage | 126 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 121 | en_US |
| dc.citation.volume | 144 | en_US |
| dc.contributor.author | Shew, PW | en_US |
| dc.contributor.author | Hsiao, PY | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:01:58Z | |
| dc.date.available | 2014-12-08T15:01:58Z | |
| dc.date.issued | 1997-03-01 | en_US |
| dc.description.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(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.identifier.doi | 10.1049/ip-cdt:19971157 | en_US |
| dc.identifier.issn | 1350-2387 | en_US |
| dc.identifier.journal | IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1049/ip-cdt:19971157 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/698 | |
| dc.language.iso | en_US | en_US |
| dc.subject | over-the-cell routing | en_US |
| dc.subject | maximum weight independent chord set | en_US |
| dc.subject | circle graph | en_US |
| dc.subject | VLSI | en_US |
| dc.title | Planar constrained terminals over-the-cell router | en_US |
| dc.type | Article | en_US |