English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58323/91876 (63%)
造訪人次 : 14065565      線上人數 : 89
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/35839


    題名: Star-routing algorithm for three-layers channel routing using manhattan-diagonal model
    其他題名: 通道繞線用曼哈頓-對角線模型的三層星狀繞線演算法
    作者: 林奕辰;Lin, Yi-chen
    貢獻者: 淡江大學電機工程學系碩士班
    饒建奇;Rau, Jiann-chyi
    關鍵詞: 星狀繞線;實體設計;細部繞線;曼哈頓-對角線模型;Star-Routing;Physical Design;Detail routing;Manhattan-Diagonal Model
    日期: 2008
    上傳時間: 2010-01-11 07:13:21 (UTC+8)
    摘要: 隨著超大型積體電路製程的日益進步,晶片設計早就已經無法單純的靠人力完成,電路的複雜度是一個很重要的主因,為了處理高複雜度的設計,所以有了電子設計自動化的產生,大幅降低從擬定規格到設計定案的時間,也節省了許多人力上的付出。

    在現在的奈米世代中,一個超大型積體電路晶片可能包含了幾百萬個電晶體,導致在佈局階段將有幾千萬條線必須完成繞線,繞線的問題變的越來越複雜,必須在有限的繞線區域內完成所有的繞線,否則必須退回到之前的步驟重新擺置所有元件,調整出更適合的繞線區域,這樣會使得整個電路設計在擺置與繞線的階段花費太多的時間。所以一個好的繞線器對整個電路設計來講是非常重要。

    在此篇論文當中,我們使用了格子化模型來解決繞線的問題,使用格子化模型來繞線,不用太複雜的資料結構來處理,可以使得繞線的複雜度降低,並且我們使用了三層的金屬層來做為繞線的主要元件,也運用到了正負四十五度角的繞線路徑,這樣可以大幅減少繞線的路徑與長度。在我們所提出的演算法中,由於我們擬定了較小的繞線格子模型,為了避免違反設計規則檢查,所以第三金屬層在繞線時有一定的限制。雖然我們的演算法使用了三層金屬層來繞線,但是這樣的繞線方法除了可以減少訊號的長度,也可以比以往的多金屬層繞線方法降低訊號間的天線效應。我們不需要增加其他空間或是移動任何的腳位即可完成百分之百的繞線,這樣對所謂的固定模組在繞線這個步驟上會比較容易完成,不用因為無法完成百分之百的繞線,而必須再重新擺置固定模組的位置,並且整個繞線的通道高度也可以減少許多。

    在測試實例中,我們使用了幾個通道繞線的測試基準,分別為YK3a、YK3b、YK3c與Deutsch’s Difficult Example (DDE)與ISCAS 85,在模擬結果,雖然在YK3c這個測試實例中,我們的繞線通道數目比較多,但是因為我們所使用的繞線格子單位較小,經過換算之後,我們的總繞線通道高度仍舊較小,整個繞線通道的高度平均減少約30個百分比的空間。
    The Very Large Scale Integration (VLSI) manufacturing technology progresses is increasingly in recent year, Integrated Circuit (IC) design cannot be accomplished successfully by the pure manpower. The complexity of the IC is the major cause. In order to deal with that, Electronic Design Automation (EDA) has greatly decreased the time form establishing the system specifications to tape-out and reduced the manpower.

    In nanometer-scale processing, a VLSI chip may contain several million transistors. As a result, it is highly probable that tens of millions of connecting nets have to be routed completely and successfully in the layout step. The problem of the routing becomes more and more complicated. We must finish the all routing nets in the finite routing region, or going back to replace the whole components in prior step. It is in order to adjust to more suitable routing region, then expending too much time in placement and routing. In a word, a nice router is very important for IC design.

    In this paper, we use the grid-model to deal with the routing problem. The advantage of using grid-model needs not too complex data structure to solve it, and making the complexity of routing lower. Besides, we use the three metal-layers to be the major components of routing. We also use the positive and negative 45 degrees routing path, and therefore reduce the routing path and length. In our proposed algorithm, we draw up the smaller grid-model, and in order to avoid violating the Design Rule Check (DRC), so the algorithm has a restriction for the third metal-layer in routing step. Although we use three metal-layers in our algorithm, this way can not only reduce the signal length but also decrease the antenna effect between signals than the other multilayer routing algorithm. We needn’t increasing the other spaces and moving any pins to finish the routing completely. The foregoing is good for hard blocks to finish the routing easily, and it does not replace the location of hard blocks because of routing incompletely. Therefore, the height of the entire routing channel can reduce a lot.

    In the test cases, we use several test benchmarks of channel routing, including YK3a, YK3b, YK3c, Deutsch’s Difficult Example (DDE) and ISCAS 85 benchmarks. In the simulation results, the result of YK3c has more numbers of the routing track than others, even so, our routing channel height after conversion still less than others, because our unit of grid-model is smaller than others. The height of routing channel decrease 30% in average and it can guarantee to achieve 100% routing.
    顯示於類別:[電機工程學系暨研究所] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    0KbUnknown411檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋