Improved particle swarm optimization algorithm for circuit partitioning problems

Abstract

Partitioning is the vital part of VLSI Physical design stage. Particle Swarm Optimization algorithm is proposed for minimization of cut size, as it is the major objective of partitioning. PSO is inspired by the social behavior of animals. The proposed algorithm is based on inertia weight results in high efficiency and converge to the global optimal solution in short time. The algorithm is tested with various benchmark functions and an example circuit. Experimental results shows that PSO algorithm with inertia weight and boundary conditions minimize the interconnect between the partitions.