VLSI Floorplanning Based on Particle Swarm Optimization

摘要：

Floorplanning is an important problem in the verylarge integrated circuit(VLSI)design automation.Itsan NP-hard combinatorial optimization problem.TheParticle Swarm Optimization(PSO)has been provedto be a good optimization algorithm with outstandingglobal performance.However,PSO cannot be directlyused in the combinatorial optimization problem due toits continuous characterisic.In this paper a novelfloorplanning algorithm based on Discrete PSO(DPSO)algorithm is proposed,in which integercoding based on module number was adopted.Theprinciples of mutation and crossover operator in theGenetic Algorithm(GA)are also incorporated into theproposed PSO algorithm to achieve better diversityand break away from local optima.Experimentsemploying MCN and GSRC benchmarks show that theperformance of our proposed algorithm for placementis good.The proposed algorithm can avoid the solutionfrom falling into local minimum and have goodconvergence performance.

作者: Guolong Chen Wenzhong Guo Hongju Cheng Xiang Fen Xiaotong Fang

作者单位: College of Mathematics and Computer Science,Fuzhou University,Fuzhou,350002,China;Key Laboratory of College of Mathematics and Computer Science,Fuzhou University,Fuzhou,350002,China

会议类型: 国际会议

会议名称: 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

会议地点: 厦门

会议语种:英文

页码: 1020-1025

在线出版日期: 2008-11-17（万方平台首次上网日期，不代表论文的发表时间）