Title: Netlist bipartitioning using particle swarm optimisation technique

Authors: Sandeep Singh Gill; Rajeevan Chandel; Ashwani Kumar Chandel

Addresses: Electronics and Communication Engineering Department, Guru Nanak Dev Engineering College, Ludhiana, Punjab 141006, India ' Electronics and Communication Engineering Department, National Institute of Technology, Hamirpur (HP) 177005, India ' Electrical Engineering Department, National Institute of Technology, Hamirpur (HP) 177005, India

Abstract: 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.

Keywords: cutsize; non polynomial hard; circuit netlist partitioning; particle swarm optimisation; PSO; interconnection; soft computing; VLSI design.

DOI: 10.1504/IJAISC.2012.048178

International Journal of Artificial Intelligence and Soft Computing, 2012 Vol.3 No.1, pp.1 - 15

Received: 07 May 2010
Accepted: 30 Apr 2011
Published online: 29 Nov 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article