A Novel Analog Routing Algorithm with Constraints of Variable Wire Widths

In this paper, we introduced a new routing algorithm, which is designed for analog circuits particularly. By the algorithm, circuit designers could deal easily with the constraint of variable wire widths, one of the most significant constraints in the computer-aid design of analog circuits. Based on the grid model, the algorithm determines the unit size of the grid under the control of given precision. For each net, the sum of the wire width and the pitch is k times larger than the unit size of grid. Therefore, in the routing phase, the classical maze algorithm is improved, introducing the mechanism of "multiple expansion steps". Experimental results demonstrate that the novel routing algorithm supports the situation of variable wire widths, and it works faster than another routing algorithm based on grid reconstruction. Furthermore, the utilization rate of resources is improved so that the routablity is enhanced as well