A heuristic algorithm for via minimization in VLSI channel routing

TLDR: This paper uses heuristic technique to find the maximum independent set of a graph with polynomial time complexity in VLSI channel routing with movable terminal and shows the experimental results and hardcopy solutions of some channel instances to prove the efficiency of this approach.

Abstract: We know that via minimization is a very important problem in channel routing. The main aim of via minimization is to improve the circuit performance and productivity, to reduce the completion rate of routing and also to fabricate integrated circuit correctly. In this paper, we are using a heuristic algorithm for solving via minimization problem in VLSI channel routing with movable terminal. Here we concentrate on how fast we find out maximum independent set from the net intersection graph. That is why here we use heuristic technique to find the maximum independent set of a graph with polynomial time complexity. Next, we show how to use that maximum independent set to solve the via minimization problem using an example. Then, we show the experimental results and hardcopy solutions of some channel instances to prove the efficiency of this approach.