Abstract: A fast FPGA placement algorithm which can deal with macro blocks is proposed. It takes advantage of an analytical method to figure out the ideal positions of all the blocks. It adjusts the positions of the blocks by local expansion. The typical simulated annealing algorithm is used to refine the placement at a low temperature. Experimental results show that in comparison with the popular VPR algorithm, the algorithm can deal with macro blocks elegantly and speeds up the placement greatly without deteriorating the quality of final placement.

Key words: macro blocks, quadratic programming, fast placement, simulated annealing

摘要： 提出一种可配置宏模块的快速FPGA布局算法。用解析模型确定所有宏模块及基本逻辑模块的理想位置，通过局部扩散得到一个合理的初始布局方案，用低温模拟退火进一步优化，确定各模块的最终位置。以平方线网总长度为目标函数，与VPR算法相比，该算法能较好地处理宏模块，大大降低布局所耗费的时间，不影响最终布局方案的质量。

关键词: 宏模块, 二次规划, 快速布局, 模拟退火

CLC Number: 

• TP391