杜星格, 袁小龙, 余明. 基于VPR的FPGA布局算法的改进[J]. 微电子学与计算机, 2013, 30(7): 64-67.
引用本文: 杜星格, 袁小龙, 余明. 基于VPR的FPGA布局算法的改进[J]. 微电子学与计算机, 2013, 30(7): 64-67.
DU Xingge, YUAN Xiaolong, YU Ming. Improvement of FPGA Placement Algorithm Based on VPR[J]. Microelectronics & Computer, 2013, 30(7): 64-67.
Citation: DU Xingge, YUAN Xiaolong, YU Ming. Improvement of FPGA Placement Algorithm Based on VPR[J]. Microelectronics & Computer, 2013, 30(7): 64-67.

基于VPR的FPGA布局算法的改进

Improvement of FPGA Placement Algorithm Based on VPR

  • 摘要: 通过在原模拟退火算法中加入回火过程对原算法进行优化,同时,减小内循环次数用于弥补回火导致的布局时间增量。回火过程用于寻找"被遗漏"的最优解。结果表明新算法利于跳出局部最优"陷阱",进一步搜索最优解,具体体现在改进后的算法不但能够保证布局质量,而且缩减了布局时间,同时,布线时间与电路关键路径延时得到不同程度的改善。

     

    Abstract: In this paper,adding the tempering process to the original algorithm and reducing the number of inner loop to compensate for layout delay increments due to tempering.This process is used to find better placement that haven been abandoned before. The results show that the new algorithm is conducive to jump out of the local optimum "trap",search for the optimal solution.In detail,the improved algorithm not only keep good placement results,but also largely reduce layout time,at the same time,routing time and critical path delay also have been reduced.

     

/

返回文章
返回