Performance Analysis of VLSI Floor planning using Evolutionary Algorithm

Floorplanning is an important physical design step for hierarchical, building-block design methodology. When the circuit size get increases the complexity of the circuit also increases. To deal with the increasing design complexity the intellectual property (IP) modules are mostly used in floorplanning. This paper presents a Hybrid particle swarm optimization algorithm for floorplanning optimization. Here B*tree is used at the initial stage in order to avoid overlapping of modules and later, PSO algorithm along with the concept of crossover and mutation from Genetic algorithm is used to get optimal placement solution. The main objective of floorplanning is to minimize the chip area and interconnection wire length. The Experimental results on Microelectronic Center of North Carolina (MCNC) benchmark circuits shows that our algorithm performs better convergence than the other methods. General Terms Floorplanning, Very Large Scale Integrated Circuits(VLSI)

[1]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.

[2]  Duanbing Chen,et al.  A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..

[3]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[4]  Narayanan Vijaykrishnan,et al.  Thermal-aware floorplanning using genetic algorithms , 2005, Sixth international symposium on quality electronic design (isqed'05).

[5]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[6]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[7]  Tsung-Ying Sun,et al.  Floorplanning based on particle swarm optimization , 2006, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06).

[8]  Pearl Y. Wang,et al.  VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions , 2002, IEEE Trans. Evol. Comput..

[9]  Guolong Chen,et al.  A PSO-based intelligent decision algorithm for VLSI floorplanning , 2010, Soft Comput..

[10]  S. Anand,et al.  Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem , 2011, Computational Optimization and Applications.

[11]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, Proceedings of International Conference on Computer Aided Design.

[12]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[13]  M. Montaz Ali,et al.  A Hybrid Simulated Annealing Algorithm for Nonslicing VLSI Floorplanning , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).