Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (18): 70-71.DOI: 10.3778/j.issn.1002-8331.2009.18.022

• 研发、设计、测试 • Previous Articles     Next Articles

Mixed ant colony and particle swarm FPGA placement algorithm

ZHAO Jun,JIA Zhi-ping   

  1. Department of Computer Science and Technology,Shandong University,Jinan 250101,China
  • Received:2008-05-09 Revised:2008-07-25 Online:2009-06-21 Published:2009-06-21
  • Contact: ZHAO Jun

蚁群与粒子群混合的FPGA布局算法

赵 军,贾智平   

  1. 山东大学 计算机科学与技术学院,济南 250101
  • 通讯作者: 赵 军

Abstract: Placement is a key issue in FPGA CAD flow.A mixed ant colony and particle swarm algorithm is used for the placement of FPGA.This method is utilized to place a set of Microelectronics Center of North Carolina(MCNC) benchmark circuits,and this paper presents a comparison with Simulated Annealing algorithm(SA),mixed Genetic and Simulated Annealing algorithm (GASA) and Ant Colony algorithm(ACO).The experimental results show that the placement method can achieve performance in terms of placement cost and routing channel density.

Key words: Field Programmable Gate Array(FPGA) placement, particle swarm, ant colony

摘要: FPGA布局在自动化设计中起到了十分关键的作用。将粒子群蚁群混合算法应用于FPGA布局问题,针对MCNC基准电路进行布局实验,并与模拟退火算法(SA),模拟退火与遗传混合算法(GASA)及蚁群算法(ACO)等进行了对比。结果表明该布局方法具有较好的性能。

关键词: 现场可编程门阵列布局, 粒子群, 蚁群