A shortest-path-search algorithm with symmetric constraints for analog circuit routing

In this paper, we introduced a new algorithm, which is used for analog circuit routing, to search for the shortest path on the grid graph. It is different from previous path searching algorithms, since it concerns the symmetric constraint, one of the most significant performance requirements of analog circuits. We formulated the problem as a programming problem, and then used a heuristic method to solve it. Herein are two new cost functions that are the core of our algorithm. Tested by hundreds of industrial cases, the experiment results show that the algorithm could not only finish routing symmetric nets, with a high rate of success, but guarantee the performance of analog circuits