分形在布局中線長(zhǎng)估計(jì)的研究
Research on evaluating wire length using fractal in placement
-
摘要: 布局問(wèn)題的目標(biāo)都是與連線長(zhǎng)度有關(guān)，且考慮時(shí)延優(yōu)化也與線長(zhǎng)有關(guān)。由于布局階段并沒(méi)有完成最終布線，若希望在無(wú)幾何走線的情況下判斷一個(gè)布局的好壞，就要有簡(jiǎn)單且又有一定精度的線網(wǎng)長(zhǎng)度估計(jì)方法來(lái)估算線長(zhǎng)。文中介紹了幾種常規(guī)的線長(zhǎng)估計(jì)方法，然后提出了一種將分形引入線長(zhǎng)估計(jì)的新方法。
-
關(guān)鍵詞:
- 線長(zhǎng)估計(jì); 分形; 盒維數(shù)
Abstract: The target of placement problem is related to the wire length, and the time delay optimization is also related to it. But in placement stage, it has not finished final routing, and must be decided without any wire routing whether a kind of placement is good or not, there must have a simple and accurate estimation method of wire net length to evaluate wire length. This paper introduces some kinds of conventional methods which are used to evaluate the wire length, then a new method using fractal to evaluate the wire length is given. -
W.M. Dai, E. S. Kuh, Simultaneous floor planning and global routing for hierarchical building block layout, IEEE Trans, on CAD, 1987, CAD-6(2), 828 837.[2]T. Hasegawa, A new placement algorithm minimizing path delays, New York, Proc. ICCAD,1991, 2052-2055.[3]U. Lauther, A min-cut placement algorithm for general cell assemblies based on a graph representation, ACM/IEEE Proc. 16th DAC, Paris, 1979, 1-10. [4]Tianmin Kong, Xianlong Hong, Changge Qiao, VEAP.[J].A global optimization based, placement algorithm for standard cell design, ASP-DAC97, Japan.1997,1:102-109[4]W.J. Sun, C. Sechen, Efficient and effective placement for very large circuits, Proc. Int. Conf.on CAD, Japan, 1993, 170-177.[5]B.B. Mandelbort, The Fractal Geometry of Nature, San Francisco, W. H. Freeman and Co.,1972, 35-100.[6]T.J. Bedford, The box dimension of selfaffine graphs and repellers, Nonlineanrity, 1989, 1(2),78-86. -
計(jì)量
- 文章訪問(wèn)數(shù): 2081
- HTML全文瀏覽量: 114
- PDF下載量: 782
- 被引次數(shù): 0
下載:
