A New FPGA Placement Algorithm for Heterogeneous Resources
In this paper,we present a new placement algorithm targeted on a modern FPGA with heterogeneous logic and routing resources. This algorithm divides the heterogeneous resources of an FPGA into different logic layers,obtains a good initial placement by a quadratic method,and then employs low-temperature simulated annealing on each logic layer to determine the final location for all modules.Experiment result shows that the algorithm not only gains a saving of runtime by 27% compared with the classical approach of Versatile Place and Route (VPR) while having the same performance,but is also highly adaptable to modern FPGAs which have heterogeneous logic and routing resources.
Field-programmable gate array (FPGA) placement heterogeneous resources macro block
Ding Xie Jiawei Xu Jinmei Lai
ASIC & System State Key Lab,Dept.of Microelectronics,Fudan University ASIC & System State Key Lab,Dept.of Microelectronics,Fudan University,825 ZhangHeng Rd,Shanghai,Chin
国际会议
2009 IEEE 8th International Conference on ASIC(第八届IEEE国际专用集成电路大会)
长沙
英文
742-746
2009-10-20(万方平台首次上网日期,不代表论文的发表时间)