Constrained via minimization for three-layer routing
| dc.contributor | 國立臺灣師範大學資訊教育研究所 | zh_tw |
| dc.contributor.author | Chang, K. E. | en_US |
| dc.contributor.author | Jyu, H. F. | en_US |
| dc.contributor.author | Feng, W. S. | en_US |
| dc.date.accessioned | 2014-10-30T09:32:06Z | |
| dc.date.available | 2014-10-30T09:32:06Z | |
| dc.date.issued | 1989-07-01 | zh_TW |
| dc.description.abstract | The previous constrained via minimization problem for VLSI previous three-layer routing is the problem of deining which previous layers can be used for previous routing the wire segments in the interconnections of nets so that the number of previous vias is minimized. This problem has been shown to be NP-complete15. In this paper, this problem is first transformed to the contractibility problem of a previous three -colourable graph, then an heuristic algorithm is proposed on the basis of the graph contractability model. From experimental results, the algorithm proves faster and more efficient at generating very good results. For a typical case, the number of previous vias can be reduced by about 30%. | en_US |
| dc.identifier | ntnulib_tp_A0904_01_002 | zh_TW |
| dc.identifier.issn | 0010-4485 | zh_TW |
| dc.identifier.uri | http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/34303 | |
| dc.language | en | zh_TW |
| dc.publisher | Elsevier | en_US |
| dc.relation | Computer-Aided Design, 21(6), 346-354. (SCI) | en_US |
| dc.relation.uri | http://dx.doi.org/10.1016/0010-4485(89)90001-8 | zh_TW |
| dc.subject.other | computer-aided design | en_US |
| dc.subject.other | VLSI design | en_US |
| dc.subject.other | via minimization | en_US |
| dc.subject.other | layer | en_US |
| dc.subject.other | assignment | en_US |
| dc.subject.other | graph contractibility | en_US |
| dc.title | Constrained via minimization for three-layer routing | en_US |