摘要
为了减少电路连线寻路距离,提高FPGA装箱算法布通率,根据网线相连节点的分布情况分析了装箱操作对网线吸收和端口占用的影响,构造了布通率驱动吸引函数;并通过对关键路径的吸收来满足路径时延要求,利用爬山法提高资源利用率,提出一种FPGA装箱算法.实验结果验证了该算法的有效性.
Increasing routability rate can reduce the distance of electric circuit connection in FPGA.In this paper,a new FPGA packing algorithm is proposed.According to node distribution,routability driven function is defined based on analysis of influence of packing on wire absorption and port occupancy.Path delay requirements are ensured by absorbing critical paths and area-efficiency is improved by hill-climbing.Experimental results are given to show the efficiency of the proposed algorithm.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2011年第9期1621-1628,共8页
Journal of Computer-Aided Design & Computer Graphics
基金
国家"八六三"高技术研究发展计划(2008AA01A323)
关键词
现场可编程门阵列
装箱
布通率
爬山法
field programmable gate array(FPGA)
packing
routability
hill climbing