Circuit Bipartition Using Genetic Algorithm

Circuit partitioning is the most critical step in the physical design of various circuits in VLSI design. In this paper, Genetic algorithm for circuit Bi-partitioning has been attempted. The genetic operators can easily be applied in this type of problem. In the partitioning main objective is to minimize the number of cuts. This chapter addresses the problem of partitioning and particular the use of the genetic algorithms for circuit partitioning. The objects to be partitioned in VLSI design are typically logic gates or instances of standard cell. Here the circuits are considered as graph where the nodes represent logic gates or cells and edges represent the connection between these gates or cells. Hence circuit partitioning problem becomes as graph partitioning problem. The algorithm can partition circuit into two sub-circuits. Our method calculates the fitness value and discards solution with low fitness value. The increase in number of crossover point does not necessarily increase the fitness, as the fitness achieved depends on crossover as well as mutation probability. Especially in the paper find minimum cut size.