反熔丝FPGA布局算法

Placement Algorithms for Antifuse FPGA

布局是大规模集成电路设计中非常重要的环节。在现场可编程门阵列(Field Programmable Gate Array,FPGA)的应用中,由于布线资源已经确定,所以FPGA的布局算法更加重要。针对反熔丝FPGA的布局应用,在目前最流行的布局算法上进行改进和优化很有必要。以建立高性能、低拥挤的布局为目标,从反熔丝FPGA芯片结构和布局算法两方面进行了深入研究。根据更精确的代价值计算,以及代价框模型和移动上限的改善,得到更有效的布局结果。反熔丝FPGA的布局算法需要新的代价值计算方法和计算公式。通过实验验证,改进后的反熔丝FPGA布局算法的布局结果更为合理,为下一步的布线工作展开建立了良好接口。

Placement is a very important part of Large Scale Integration Design.It ＇s especially important on the application of Field Programmable Gate Way （FPGA）as a result of the routing resource is fixed.It ＇s necessary to improve algorithm to adapt for antifuse FPGA based on the most popular placement algorithm.Aiming at the higher performance and lower congestion,this article mainly focuses on the antifuse FPGA architecture model and related placement algorithm.The better placement result is found according to the exact cost and the improved bounding box and move limit.The placement algorithms of antifuse FPGA needs a new way to compute the cost and the corresponding mathematical model.The experimental results show that the improved algorithm is more reasonable for antifuse FPGA and provides the better interface for the routing.