一个基于拥阻密度估计的布局优化方法

这篇论文应用了文献中一个基于概率的拥阻密度模型和快速计算方法.引入了一个新的目标函数．这个目标函数考虑了总线长和拥阻密度之间的平衡。使用这样一个目标函数．文中设计了一个基于仿真退火(Simulated Annealing)的布局优化算法.用于探索一个总线长和拥阻密度较低的布局．这样的布局便于提高芯片性能和节省芯片面积．也利于使布线获得较早成功。文中用所提出的优化布局算法对一个LDPC设计进行了验证。实验结果显示出这种算法能有效地降低总线长和拥阻密度.并且具有很好的运行时间效率。

A placement optimization algorithm using congestion estimation1

A placement optimization algorithm is developed in this paper using a probabilistic congestion estimation model proposed in the literature. The congestion estimation obtained from a placement allows us to consider a balanced optimization objective consisting of total wire length and routing congestion. A simulated annealing algorithm is designed to search the placement with a cost as lower as possible. The proposed algorithm is tested by a LDPC design example. Experimental results show that this algorithm can effectively reduce the total wire length and routing congestion with fast runtime.