Bin packing approach for solving VLSI circuit partitioning problem using Genetic algorithm

In this paper,the circuit partitioning using genetic algorithm with bin packing concept has been attempted. In ???this practical paper solution is easy and we can easily apply genetic operator in this type of problem. The bin packing problem is to find the minimum number of bins needed to pack a given set of objects of known sizes so they do not exceed the capacity of each bin. Complexity is both time in space, provided size of problem an as integer (count is infinite).This problem is known NP-hard. The technique of our approach is to be design module trick. We can be realizing with self standard IC chip. Obviously we have taken into account minimum power conjunction. The solution of a circuit partitioning problem is global optimum. Like circuit partitioning is the more critical step in the physical design of various circuit in VLSI.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 object to be partitioned in VLSI design are typically logic gates or instances of standard cell. Circuit partitioning is one of the important parts in chip designing. We let, the number of bins will be needed equal to be number of genes divided by number of bins. At first the genes will be insert in first bin until the bin is not full, when bin is full then insert second bin and so on. 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. If we get, cut size is same on generation than change the crossover boundary. This paper shows bin packing approach for the circuit partitioning using genetic algorithm . Genetic algorithm is an evolutionary optimization technique based on Darwinian Theory of natural evolution and its concept of survival of the fittest. The main advantage of circuit partitioning using bin packing are- “Initial partition is ?not required,? there are no ?need to encoding chromosome with block number ?also ?chromosome will? ?be ??encoded? ?by? ?gate? ?or? ?node?? ?name? with? BFS? and Any sequence”. Also the main superiority? over? circuit? partitioning? using?? GA?? is “we can do easily multi way partitioning in many types of VLSI circuit, there is no need to do initial partitioning”.