完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Huang, Hsin-Hsiung | |
dc.contributor.author | Huang, De-Jing | |
dc.contributor.author | Hsieh, Tsai-Ming | |
dc.date.accessioned | 2009-08-23T04:42:43Z | |
dc.date.accessioned | 2020-05-25T06:53:49Z | - |
dc.date.available | 2009-08-23T04:42:43Z | |
dc.date.available | 2020-05-25T06:53:49Z | - |
dc.date.issued | 2007-01-25T06:44:31Z | |
dc.date.submitted | 2006-12-04 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/3463 | - |
dc.description.abstract | We propose a three-stage spanning-graph based algorithm to connect all pins with obstacles. At the first stage, we construct the spanning graph according to the given pins and the four corner points of the obstacles. At the second stage, the searching algorithm is performed to find a sub-graph, the spanning tree, and transform the spanning tree into a rectilinear Steiner tree at the third stage. The objective of the algorithm is to minimize the total wire-length. Compared with the results without obstacles, it shows experimentally that our algorithm can obtain the routing solution with only 1.4% extra total wire-length and 9.86% additional via counts with consideration of obstacles. | |
dc.description.sponsorship | 元智大學,中壢市 | |
dc.format.extent | 4p. | |
dc.format.extent | 3885511 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2006 ICS會議 | |
dc.subject.other | VLSI Physical Design Automation | |
dc.title | Rectilinear Steiner Tree Construction with Obstacles | |
分類: | 2006年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002006000013.pdf | 3.79 MB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。