利用笛卡爾偵測線及R樹保留繞線行為之類比佈局遷移技術

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：56

、訪客IP：3.145.130.31

姓名

洪嘉壕(Chia-Hao Hung) 查詢紙本館藏

畢業系所

電機工程學系

論文名稱

利用笛卡爾偵測線及R樹保留繞線行為之類比佈局遷移技術
(Analog Layout Migration Considering Routing Preservation with CDL-based R-tree)

相關論文

★ 運算放大器之自動化設計流程及行為模型研究	★ 高速序列傳輸之量測技術
★ 使用低增益寬頻率調整範圍壓控震盪器之1.25-GHz八相位鎖相迴路	★ 類神經網路應用於高階功率模型之研究
★ 使用SystemC語言建立IEEE 802.3 MAC 行為模組之研究	★ 以回填法建立鎖相迴路之行為模型的研究
★ 高速傳輸連結網路的分析和模擬	★ 一個以取樣方式提供可程式化邏輯陣列功能除錯所需之完全觀察度的方法
★ 抑制同步切換雜訊之高速傳輸器	★ 以行為模型建立鎖相迴路之非理想現象的研究
★ 遞迴式類神經網路應用於序向電路之高階功率模型的研究	★ 用於命題驗証方式的除錯協助技術之研究
★ Verilog-A語言的涵蓋率量測之研究	★ 利用類神經模型來估計電源線的電流波形之研究
★ 5.2GHz CMOS射頻接收器前端電路設計	★ 適用於OC-192收發機之頻率合成器和時脈與資料回復電路

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

由於製程演進的速度非常快，常常需要將舊製程的電路遷移到先進製程中，為降低非理想效應對電路效能的影響。重複使用已經設計好的佈局擺置和繞線，可以大大減少設計的時間。因此，佈局遷移自動化的目標，就是希望能完整記錄原始佈局的資訊，並在先進製程環境中重建佈局。這部分的相關研究已經很完整，但大多只記錄佈局擺置的資訊，有記錄佈局繞線行為的相關文章並不多，因為缺少原本繞線的行為，最後只能選擇最短路徑做佈局繞線，使電路中的寄生效應變成不匹配，而影響電路整體的效能。
本論文提出一個在佈局遷移中記錄繞線行為的類比設計自動化流程，並提出一個快速紀錄繞線行為的方式–笛卡爾偵測線(CDL)，希望在佈局遷移中完整且快速的將繞線行為記錄下來，使佈局繞線不匹配的程度降到最低。在之前的研究中所採用的記錄方式，更新製程後可能會失去部分的記錄資訊，使得佈局繞線完整度不如預期，而我們提出的笛卡爾偵測線可以提高重建佈局繞線的完整度，完整重現每一條繞線的走向；另外，我們引入了一個快速區域搜尋的演算法R樹(R-tree)，有效提高了記錄佈局繞線的速度與準確度，如實驗數據所示，將電路從180nm遷移到90nm製程之後，此方法仍可完整保留繞線方式及電路效能。

摘要(英)

Because of the fast evolution of VLSI process, migrating the old layout designs to advance technology is in need. In order to reduce the impact of non-ideal effects on circuit performance, reusing the placement and routing of well-designed layout is able to greatly reduce design time. Recording the design information of source layout completely and reconstructing the target layout in advance technology is often called as automatic layout migration. Most of previous research focus on placement preservation only without the discussion on preserving routing behavior. If the routing behavior of source layout is not considered, the shortest path result is often chosen as the routing for target layout, which may induce extra mismatching effects and change circuit performance.
This thesis proposes a routing behavior preservation approach for analog layout migration. Based on the proposed Cartesian Detection Line(CDL), the routing behavior of original layouts can be preserved completely to used be reconstructed in new technology efficiently to reduce the routing mismatching. In previous works, the routing completeness may not reach 100%, because some routing information might be lost in new technology. Using the proposed CDL, the routing path of each net can be reconstructed completely to improve the routing completeness in new technology. In addition, a fast layout query algorithm based on R-tree is also proposed to enhance the speed and accuracy of routing reconstructing. As shown in the experimental results, the proposed algorithm successfully preserve the routing behavior and keep circuit in a good performance while migrating the circuit from 180nm process to 90nm process.

關鍵字(中)

★ 類比電路佈局
★ 繞線保留
★ 佈局遷移
★ R-樹

關鍵字(英)

★ analog layout
★ layout migration
★ R-tree
★ routing preservation

論文目次

摘要 i
Abstract ii
致謝 iii
目錄 iv
圖目錄 vi
表目錄 ix
第一章、緒論 1
1-1 類比電路設計自動化 1
1-2 研究動機 3
1-3 問題定義 8
1-4 論文結構 9
第二章、背景知識 10
2-1 類比電路佈局遷移 10
2-1-1 佈局擺置遷移 10
2-1-2 佈局繞線遷移 11
2-2 保留佈局資訊 12
2-2-1 擺置 12
2-2-2 繞線 17
2-3 最佳化方法 21
2-4 快速佈局搜尋技術 26
第三章、演算法流程 28
3-1 CDL 29
3-1-1 建構CDL 31
3-1-2 加速CDL的搜尋速度 32
3-2 繞線行為紀錄 35
3-2-1 建構佈局搜尋圖 35
3-2-2 建構交會點圖 36
3-2-3 階級式記錄繞線行為 37
3-3 重建佈局繞線圖 38
3-3-1 重建交會點 38
3-3-2 繞線轉彎更新 39
3-3-3 更新峰值錯誤 40
第四章、實驗結果及分析 42
4-1 實驗環境與電路 42
4-2 電流鏡運算放大器實驗結果 43
第五章、結論與未來展望 48
參考文獻 49

參考文獻

[1] R.-A. Rutenbar, “Design Automation for Analog: The Next Generation of Tool Challenges,” 1st IBM Academy Conference on Analog Design, Technology, Modeling and Tools, IBM T.J. Waston Research Labs 2006.
[2] J. Scheible, and J. Lienig, “Automation of Analog IC Layout Challenges and Solutions,” in Proc. of ISPD, pp.33-40, 2015.
[3] P.-H. Lin, Y.-W. Chang, and S.-C. Lin, “Analog Placement Based on Symmetry–Island Formulation,” IEEE Transactions on Computer-Aided Design, vol. 28 no. 6 pp. 791-804, Jun 2009.
[4] Y.-P. Weng, H.-M. Chen, T.-C. Chen, P.-C. Pan, C.-H. Chen, and W.-Z. Chen, “Fast Analog Layout Prototyping for Nanometer Design Migration,” in Proc. of ICCAD, pp. 517-522, 2011.
[5] P.-Y. Chou, H.-C. Ou, and Y.-W. Chang, “Heterogeneous B*-trees for Analog Placement with Symmetry and Regularity Considerations,” in Proc. of ICCAD, pp. 512-516, 2011.
[6] C.-Y. Chin, et al. “Efficient analog layout prototyping by layout reuse with routing preservation,” in Proc. of ICCAD, 2013.
[7] S. Wang, J. Xinzhang, B. Yeh Arthur, and Z. Lihong, “Analog layout retargeting using geometric programming.” ACM Transactions on Design Automation of Electronic Systems, vol. 16 no. 4 pp. 50, Oct 2011.
[8] J. Serras, and L.-M. Silveira,. “Hierarchical analog layout migration with pcells.” in Proc. of VLSI-SoC, pp. 197-202, 2009.
[9] S.-H. Batterywala, S. Bhattacharya, S. Rajagopalan, H.-K.-T. Ma, and N.-V. Shenoy, “Cell Swapping Based Migration Methodology for Analog and Custom Layouts,” in Proc. of ISQED, pp. 450–455, 2008.
[10] A.-W. Achter, and L.-T. Biegler, “On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming.” Mathematical programming. Vol. 106 no. 1 pp. 25–57, Mar 2006.
[11] Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu, “B*-Trees: A New Representation for Non-Slicing Floorplans,” in Proc. of DAC, pp. 458-463, 2000.
[12] P.-H. Lin, Y.-W. Chang, and S.-C. Lin, “Analog Placement Based on Symmetry-Island Formulation,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 28 no. 6 pp. 791-804, Jun 2009.
[13] Y.-P. Weng, H.-M. Chen, T.-C. Chen, P.-C. Pan, C.-H. Chen, and W.-Z. Chen, “Fast analog layout prototyping for nanometer design migration.” in Proc. of ICCAD, pp. 517-522, 2011.
[14] P.-C. Pan, C.-Y. Chin, H.-M. Chen, T.-C. Chen, C.-C. Lee, and J.-C. Lin, “A fast prototyping framework for analog layout migration with planar preservation,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems vol. 34 no. 9 pp. 1373-1386, Apr 2015.
[15] J.-R. Shewchuk, “Delaunay refinement algorithms for triangular mesh generation,” Computational geometry vol. 22 no.1.3 pp.21-74, May 2002.
[16] A. Guttman, “R-trees: A dynamic index structure for spatial searching.” in Proc. of ACM SIGMOD international conference on Management of data, pp. 47-57, 1984.
[17] S. Bhattacharya, N. Jangkrajarng, and C.-J.-R. Shi, “Multilevel symmetry-constraint generation for retargeting large analog layouts,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. vol. 25 no. 6 pp. 945-960, Jun 2006
[18] K. Ibrahim, and F. Christos, “On Packing R-Tree,” in Proc. of ACM second international conference on Information and knowledge management, pp. 490-499, 1993.
[19] B. Mandelbrot, Fractal Geometry of Nature. W.H. Freeman, New York, 1977
[20] SynopsysR LakerR, http://www.synopsys.com
[21] SynopsysR HspiceR, http://www.synopsys.com
[22] H.-Y. Chi, H.-Y. Tseng, C.-N. Jimmy Liu, and H.-M. Chen, “Performance-preserved analog routing methodology via wire load reduction,” in Proc. of ASP-DAC, pp. 482-487, 2018.
[23] https://en.wikipedia.org/wiki/Cartesian_coordinate_system
[24] https://en.wikipedia.org/wiki/Monotonic_function
[25] O.-D.-A. Kazuhiro, A.-P. Louis, and J.-G. Anthony. “A New Methodology for Analog/Mixed-Signal (AMS) SoC Design that Enables AMS Design Reuse and Achieves Full-Custom Performance,” Toshiba/Neolinear 2002
[26] M. Zachariasen, “A catalog of Hanan grid problems,” Networks: An International Journal vol. 38 no. 2 pp. 76-83, Sep 2001.

指導教授

劉建男

審核日期

2018-7-26

推文