论文部分内容阅读
描述了一种新的基于单元扩大的拥挤度驱动的布局算法 .这个方法用概率估计模型和星型模型来评价线网的走线 .使用全局优化和划分交替的算法来进行总体布局 .提出了单元的虚拟面积的概念 ,单元的虚拟面积不仅体现了单元的面积 ,而且指出了对布线资源的需求 .单元的虚拟面积可以由单元的扩大策略来得到 .把单元的虚拟面积用到划分过程中 ,从而减小拥挤度 .并且使用了单元移动的策略来进一步减小走线的拥挤 .用来自美国公司的一些例子测试了这个算法 ,结果显示布局的结果在可布性方面有了很大的提高
A new congestion-driven layout algorithm based on cell expansion is described. This method evaluates the routing of the wire network using a probabilistic estimation model and a star model. The overall layout is optimized using global optimization and partitioning alternation algorithms Unit virtual area concept, the unit of virtual area not only reflects the unit area, but also pointed out the need for wiring resources.Under the virtual area of the unit can be expanded by the unit to get.Using the virtual area of the unit in the division process , Thereby reducing the degree of congestion and using a cell-moving strategy to further reduce trace crowding.We tested this algorithm with some examples from a U.S. company and found that the layout results have a large improve