An Approach for Reducing Crosstalk in Restricted Channel Routing Using Graph Coloring Problem and Genetic Algorithm

In this paper a technique has been introduced for reducing crosstalk for restricted channel routing. First, the random channel specification is generated. After that the adjacency matrix of the corresponding random channel specification is created and the horizontal constraint graph (HCG) is drawn. Using the existing graph coloring algorithm and the Genetic Algorithm (GA) the HCG is tinted. The minimum number of color gives us the minimum number of tracks that have been required to route different nets into the tracks. The Crosstalk is measured after assigning the different nets into the tracks. It is found that the Crosstalk minimization technique using Genetic Algorithm is better than the other existing techniques.