請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/74495
標題: | 考慮波導匹配限制之晶片上光繞線 On-chip Optical Routing with Waveguide Matching Constraints |
作者: | Fu-Yu Chuang 莊馥宇 |
指導教授: | 張耀文(Yao-Wen Chang) |
關鍵字: | 實體設計,波導匹配,光繞線, Physical Design,Waveguide Matching,Optical Routing, |
出版年 : | 2019 |
學位: | 碩士 |
摘要: | 在積體電路的深奈米技術節點之中,為了因應晶片對大頻寬與低功耗日趨嚴苛的要求,光學積體電路(Photonic Integrated Circuits, PICs)逐漸成為一個有前景的解決方案。在光學積體電路中,晶片上的訊號傳遞是透過光互連(optical interconnections)的形式達成。在文獻上有許多針對光學積體電路繞線問題的演算法被提出,這些文獻分別考慮不同電路設計上的問題,例如:熱可靠度(thermal reliability)、訊號傳遞損失(transmission loss)等。
然而,在許多新興的應用之中,不同的光路徑需要被匹配才能保證電路正確的功能性,匹配的條件包含路徑長度、路徑的彎曲數量、路徑彎曲的曲率半徑、路徑的交叉數量等。就我們所知,這些光繞線路徑匹配的限制在目前並沒有文獻提出方法處理。 在本篇論文中,我們提出了一套完整的繞線流程,包含預處理階段(preprocessing stage)、全局繞線階段(global routing stage)以及細部繞線階段(detailed routing stage)。在預處理階段中,我們建立基於六邊形繞線風格的最佳史坦納樹來處理多腳位信號線。接著我們使用基於整數線性規劃(Integer Linear Programming, ILP)的全局繞線演算法處理波導匹配限制,並同時最小化總訊號傳遞損失。最後,採用基於A星搜尋演算法並遵從全局繞線結果的細部繞線來決定最終的光繞線拓樸。 實驗結果顯示我們的光繞線器在所有的光電路設計上能夠達到百分之百的繞線率,且與一般基於A星搜尋演算法的匹配繞線器相比,我們的光繞線器在不違反任何波導匹配的限制之下,能夠達成較小的總訊號傳遞損失以及最大訊號傳遞損失。 In the deep nanometer VLSI technology node, photonic integrated circuits (PICs), which introduce optical interconnections for on-chip communication, have become one of the most promising solutions to the increasing requirements with large bandwidth and low-power consumption. Routing techniques for optical interconnections have been proposed to deal with different routing issues in PICs, including thermal reliability, transmission losses, and other design considerations. In some emerging applications, however, different optical paths are required to be closely matched (in terms of the path length, the number of bends, the radius of curvature of bends, and the crossing count) to operate correctly. To the best of our knowledge, there is no previous work dealing with these matching constraints in optical routing. In this thesis, we propose a complete algorithm flow consisting of the preprocessing stage, the global routing stage, and the detailed routing stage. In the preprocessing stage, an optimal Steiner tree is constructed with a hexagonal routing style to handle multi-pin nets. Then, an integer-linear-programming-based global routing is adopted to deal with the matching constraints while minimizing the total transmission loss in a design. Finally, an A*-search detailed routing which honors the global routing result is adopted to generate the final routing topology. Experimental results on the 2007 ISPD Global Routing Contest designs with proper netlist preprocessing show that our optical router can route all nets without violating any matching constraints while achieving lower total/maximum transmission loss compared to an A*-search-based match-net routing. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/74495 |
DOI: | 10.6342/NTU201902861 |
全文授權: | 有償授權 |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-108-1.pdf 目前未授權公開取用 | 3.7 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。