跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.23) 您好!臺灣時間:2025/10/27 05:28
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:利平一
研究生(外文):Li, Pin Yi
論文名稱:混合斜率模式多接腳通道繞線問題之新解法
論文名稱(外文):A New Multi-Terminal Channel Router for Mixed Slope Model
指導教授:謝財明謝財明引用關係
指導教授(外文):Hsieh, Tsai Ming
學位類別:碩士
校院名稱:中原大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1994
畢業學年度:82
語文別:中文
論文頁數:70
中文關鍵詞:通道繞線問題混合斜率模式貪婪繞線方法多接腳問題目標搜尋演算法
外文關鍵詞:channel routing problemMixed Slope Modelgreedy routing methodMaze Router
相關次數:
  • 被引用被引用:0
  • 點閱點閱:314
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在通道繞線問題領域中,混合斜率模式(Mixed-Slope Model,MSM)是個新
興的繞線模式,除了水平及垂直方向外它比傳統曼哈頓模式 (Manhattan
Model,MM)多了+45°及-45°兩個繞線方向。本論文將提出一綜合一個貪
婪繞線演算法則,及配合一個以最小花費為導向的目標搜尋演算法則,來
求得混合斜率模式下多接腳通道繞線問題之繞線解。本論文提出之繞線演
算法則有下列幾項特點: 1.本論文所採用的混合斜率模式比傳統曼哈頓
模式限制較少,可選擇的繞線路徑將會更多,因此更有機會得到更佳的結
果。 2.此繞線演算法,先是以貪婪繞線演算法快速的完成大部分連線組
的繞線,最後再以最小花費為導向的目標搜尋演算法則處理未完成的繞線
,因此可以彌補貪婪繞線方法的不足,而充分提高了通道繞線的完成度
。 3.本論文的繞線演算法,亦可提供兩層間連線組的可重疊模式。 4.此
繞線演算法,以物件導向技術發展完成,因此未來在演算法上的修改或是
擴充功能上,均很方便。實驗証明本論文提出之繞線演算法在大部份的例
子上得到不錯的繞線結果,且大都較傳統曼哈頓模式下的解使用了更少的
通道內軌道數。在一些典型例子像Shift by N Channel,Reverse by N
Channel都可得到和前人最好的繞線結果相同或更佳的繞線結果。特別在
Perfect Shuffle Permutation Channel上,我們可用這類通道之最佳解
的通道內軌道數來完成繞線,另外像Burstein Difficult Channel 其繞
線結果亦優於現存的結果。

In the field of channel routing problem, Mixed Slope Model
(MSM) is a young routing model.Mixed Slope Model has two wiring
directions(+45°,-45°) than the directions (0°,90°) that
Manhattan Model has.In this thesis, we propose a new multi-
terminal channel router for Mixed-Slope Model.The proposed
method is essentially a combination of the methods of greedy
router and maze router. The algorithm in this thesis has
following benefits: 1.Mixed Slope Model has less constraints
than the Manhattan Model. And we have more chance to obtain
better solution in channel routing. 2.We initially use greedy
routing method to rapidly interconnect most of nets, and then
employ minimum cost oriented maze router in order to
interconnect the remaining nets. As a result, high connection
ratio can be achieved. 3.The router algorithm in this thesis
provides that net on one layer can be overlapped by other net
on different layer. 4.We use objected-oriented technology to
develop this algorithm. And it is convenient for modifying and
extending. Extensive experiments have been made to test the
performance of our router. As we expected, in most of the
channels under tested, fewer tracks are needed in Mixed-Slope
model than that in the MM. to route the channel completely. In
some classical examples such as Shift by N Channel and Reverse
by N channel, we can get solutions as well as other routers or
better. In particular for Perfect Shuffle Permutation Channel
we can get better solution which use tracks of the optimal
solution. And we can also get better solution of Burstein
Difficult Channel than the result of other router.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top