跳到主要內容

臺灣博碩士論文加值系統

(3.236.50.201) 您好!臺灣時間:2021/08/02 02:05
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:姜昇志
研究生(外文):Sheng-JhihJiang
論文名稱:使用漸進式平面規劃技術之快速類比佈局修改架構
論文名稱(外文):A Rapid Analog Amendment Framework Using Incremental Floorplanning Technique
指導教授:何宗易
指導教授(外文):Tsung-Yi Ho
學位類別:碩士
校院名稱:國立成功大學
系所名稱:資訊工程學系碩博士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:英文
論文頁數:41
中文關鍵詞:平面規劃類比佈局
外文關鍵詞:floorplananaloglayout
相關次數:
  • 被引用被引用:0
  • 點閱點閱:117
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
現今的類比晶片設計流程中,為了減低重新設計電路的複雜度,電路設計師通常會使用過去設計好的電路來快速地得到一個平面規劃。如果新的電路需要修改,電路中有許多的元件會需要符合一些複雜的限制,例如固定位置、固定面積、或是固定面積下要從多邊形調整成矩形。由於類比設計缺乏自動化的工具,因此設計者很難手動地完成這些調整。此外,在之前的研究中並未出現同時考慮這些限制來解決此修改問題的方法。因此,在這此篇論文中,我們定義了四種區塊形態來代表此修改問題中有不同限制的區塊。接著,我們開始整個修改的程序:先取得在原始平面規劃中元件的拓撲,然後為所有因為內部類比電路的需求,如元件匹配,而必須被調整為矩形的區塊決定最終的形狀。最後,清除因為部分區塊形狀改變而產生的重疊區域。當所有重疊區域皆被清除後,即可得到一可行的平面規劃。根據我們提出的架構處理後,一個符合修改需求的平面規劃即可被產出。實驗結果顯示我們所提出的處理架構是可靠的。
In modern analog design flow, to reduce the complexity of designing new circuits, designers usually reuse previous designed circuits for fast floorplan prototyping. If design amendment is required in the new circuits, several components will need to follow complicated constraints such as fixed location, fixed shape, or change shape from rectilinear to rectangular. It is difficult for designers to refine the floorplan manually because of the lack of automation tools for analog designs. Moreover, there is no previous work considered all the constraints simultaneously to overcome the amendment problem. Therefore, in this thesis, we define four block types for modeling the block with different constraints in the amendment process. Then, we start the amendment process by extracting the component topology in the initial floorplan and then determining the target shapes of blocks which should be reshaped to rectangles for internal analog electrical features such as device matching. Finally, we eliminate the overlaps induced by above reshaping. If all the overlaps are eliminated, a new feasible floorplan is obtained. After applying our framework, a modified floorplan will be produced to fit the amendment. Experimental result shows that the proposed framework is very promising.
摘要 i
Abstract ii
致謝 iv
Table of Contents v
List of Tables vii
List of Figures viii
1 Introduction 1
1.1 Our Contributions 4
1.2 Problem Formulation 5
2 Preliminaries 7
2.1 Representation 7
2.2 SA-Based Approach 8
2.3 Analytical Approach 9
2.4 Network Flow Approach 9
2.5 Incremental Floorplanning 10
3 Methodology 12
3.1 Topology Extraction 13
3.1.1 Geometric Information Extraction of Rectangular Block 13
3.1.2 Geometric Information Extraction of Rectilinear Block 14
3.1.3 Constraint Graph 15
3.2 RB Block Reshaping 15
3.2.1 Balance Line Finding 16
3.2.2 Candidate Collecting and Obstacle Block Checking 17
3.2.3 Target Shape Selecting 20
3.3 Topology Reinforcement 22
3.3.1 Overlap Elimination 23
3.3.2 Rectilinear Block Information 23
3.3.3 Space Information 24
3.3.4 Block Deformation 25
3.3.5 Operations for Overlap Elimination 26
3.3.6 Elimination Strategy 27
4 Experimental Results 32
4.1 Effectiveness of RB Block Reshaping 32
5 Conclusion 37
Bibliography 38

[1] D. A. Johns and K. Martin, Analog Integrated Circuit Design, Wiley, 1997.
[2] A. Hastings, The Art of Analog Layout, 2nd Ed., Prentice Hall, 2006.
[3] Y.-C. Chang, Y.-W. Chang, G.-M. Wu, S.-W. Wu , “B*-trees: a new representation for non-slicing floorplans,“ IEEE/ACM Design Automation Conference, pp. 458–463, 2000.
[4] Murata, Fujiyoshi, K., Nakatake, S., Kajitani, Y., “VLSI module placement based on rectangle-packing by the sequence-pair,“ IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 1518–1524, Dec 1996.
[5] J.-M. Lin, Y.-W. Chang , “TCG: a transitive closure graph-based representation for non-slicing floorplans,“, IEEE/ACM Design Automation Conference, pp. 764–769, 2001.
[6] J.-M. Lin, Y.-W. Chang, S.-P. Lin, “Corner sequence - a P-admissible floor-
plan representation with a worst case linear-time packing scheme,“ IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp. 679–686,2003.
[7] J. Liu, W. Zhong, L. Jiao, X. Li, “Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped
Rectilinear Blocks,“ IEEE Transactions on Evolutionary Computation, pp. 630–646, Oct 2008.
[8] M. Kang, W.W.-M. Dai, “General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure,“ IEEE/ACM Asia and South Pacific Design Automation Conference, pp. 265–270, Jan 1997.
[9] Hai Zhou, Jia Wang, “ACG-adjacent constraint graph for general floorplans,“ IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 572–575, Oct 2004.
[10] X. Hong, .g Huang, Y. Cai, J. Gu, S. Dong, C.-K Cheng, J. Gu , “Corner block list: an effective and efficient topological representation of non-slicing floorplan,“ IEEE/ACM International Conference on Computer Aided Design,
pp. 8–12, 2000.
[11] X. Tang , R. Tian, D. F. Wong, “Fast evaluation of sequence pair in block placement by longest common subsequence computation,“ ACM conference
on Design, automation and test in Europe, pp. 106–110, 2000.
[12] Fujiyoshi, K. and Murata, H., “Arbitrary convex and concave rectilinear block packing using sequence-pair,“ Proc. IEEE/ACM International Conference on
Computer-Aided Design, pp. 224–233, 2000.
[13] Y. Pang, C.-K. Cheng, K. Lampaert, and W. Xie, “Rectilinear block packing using O-tree representation,“ ACM International Symposium on Physical Design, pp. 156–161, 2001.
[14] X. Li, Y. Ma, X. Hong, S. Dong, “An Analytical Approach to Incremental Floorplanning,“ International Conference on Communications, Circuits and Systems, pp. 1145–1149, July 2007.
[15] X. Li, Y. Ma, X. Hong, S. Dong, “Thermal-aware incremental floorplanning for 3D ICs,“ IEEE Internaltional Conference on ASIC, pp. 1092–1095, Oct 2007.
[16] Yan Feng, Mehta, D.P., Yang, H., “Constrained floorplanning using network flows , “ IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 572–580, April 2004.
[17] Yan Feng, Mehta, D.P., “Heterogeneous floorplanning for FPGAs,“ IEEE International Conference on VLSI Design, Jan 2006.
[18] Z. He, Y. Ma, N. Xu, Y. Wang, X. Hong, “On handling fixed blocks in incremental fixed-outline floorplanning,“ IEEE Internaltional Conference on Communications, Circuits and Systems, pp. 876–880, July 2010.
[19] L. Li; Y. Ma; N. Xu; Y. Wang; X. Hong, “Floorplan and Power/Ground network co-design using guided incremental floorplanning,“ IEEE Internaltional Conference on ASIC, pp. 747–750, Oct 2009.
[20] Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki, “A note on greedy algorithms for the maximum weighted independent set problem, “ Discrete Applied Mathematics, pp. 313-322, March 2003.
[21] Ousterhout, J.K., “Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools,“ IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 87–100, January 1984.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top