分形在布局中线长估计的研究
Research on evaluating wire length using fractal in placement
-
摘要: 布局问题的目标都是与连线长度有关，且考虑时延优化也与线长有关。由于布局阶段并没有完成最终布线，若希望在无几何走线的情况下判断一个布局的好坏，就要有简单且又有一定精度的线网长度估计方法来估算线长。文中介绍了几种常规的线长估计方法，然后提出了一种将分形引入线长估计的新方法。
-
关键词:
- 线长估计; 分形; 盒维数
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. -
计量
- 文章访问数: 2056
- HTML全文浏览量: 108
- PDF下载量: 782
- 被引次数: 0
下载:
