Abstract—In this paper multiway circuit partitioning of circuits using Genetic Algorithms has been attempted. Due to the random search, inherent parallelism, and robustness of genetic algorithms, the solution of a circuit partitioning problem is global optimum. Results obtained show the versatility of the proposed method in solving NP hard problems like circuit partitioning. Results obtained show an improvement over the results of UCLA Branch and Bound partitioner [27]. Information of the circuit has been given in accordance with circuit netlist files used in ISPD’98 circuit benchmark suite.

Index Terms—Partitioning, Genetic algorithm, NP Hard, Net list, Crossover, mutation.

Sandeep Singh Gill is working as Asstt. Prof., ECE Deptt., GNDEC,Ludhiana, Punjab, India.
Rajeevan Chandel is Asstt. Prof. & Head, E & CED, NIT, Hamirpur,H.P., India.
Ashwani Chandel is Asstt. Prof., EED, NIT, Hamirpur, H.P., India.

Cite: Sandeep Singh Gill, Dr. Rajeevan Chandel and Dr. Ashwani Chandel, "Genetic Algorithm Based Approach To Circuit Partitioning," International Journal of Computer and Electrical Engineering vol. 2, no. 2, pp. 196-202, 2010.