NEW ITERATIVE CONSTRUCTION APPROACH TO ROUTING WITH COMPACTED AREA
| dc.citation.epage | 71 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 57 | en_US |
| dc.citation.volume | 138 | en_US |
| dc.citation.woscount | 6 | |
| dc.contributor.author | TSAI, CC | en_US |
| dc.contributor.author | CHEN, SJ | en_US |
| dc.contributor.author | HSIAO, PY | en_US |
| dc.contributor.author | FENG, WS | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:05:23Z | |
| dc.date.available | 2014-12-08T15:05:23Z | |
| dc.date.issued | 1991-01-01 | en_US |
| dc.description.abstract | The new iterative construction approach presented in this paper consists of three algorithms, namely, channel expansion routing, track assignment, and module location refinement. These algorithms, contrary to the conventional methods implemented with a sequence of tools separately, are linked with a common data structure which guarantees a maximal compatibility. With an initial nonoverlapping placement as input, the iterative construction approach generates a final layout with more compacted area than the layout result from the one-dimensional compactor or some of two-dimensional compactors. Several layout examples in the literature are tested to show the effectiveness of our approach. | en_US |
| dc.identifier.issn | 0143-7062 | en_US |
| dc.identifier.journal | IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3916 | |
| dc.identifier.wosnumber | WOS:A1991EU14300008 | |
| dc.language.iso | en_US | en_US |
| dc.subject | PLACEMENT | en_US |
| dc.subject | ROUTING | en_US |
| dc.subject | COMPACTION | en_US |
| dc.subject | ALGORITHMS | en_US |
| dc.title | NEW ITERATIVE CONSTRUCTION APPROACH TO ROUTING WITH COMPACTED AREA | en_US |
| dc.type | Article | en_US |