Netlist bipartitioning using particle swarm optimisation technique

In this paper circuit netlist bipartitioning using particle swarm optimisation technique is presented. Particle swarm optimisation is a powerful evolutionary computation technique for global search and optimisation. The circuit netlist is partitioned into two partitions such that the number of interconnections between the partitions (cutsize) is minimised. Results obtained show the versatility of the proposed soft computing method in solving non polynomial hard problems like circuit netlist partitioning.