A loop routing approach for decreasing critical path delay

In this paper, we propose a loop routing performance optimization approach, which create loops in the existing routing trees for the purpose of decreasing delay of the selected critical path or maximum delay for a net. The interconnect tree is formulated as a tree of distributed transmission lines and Elmore delay is used for delay calculation. It is proven that the delay of a selected critical path or maximum delay for a net can be reduced dramatically by introducing a new link with appropriate R, C values between the reference node and the critical node in the existing tree topology. We give the wire length selection on the basis of pre-calculated time delay of node and the resistance and capacitance array. Experiments show the effectiveness of our approach for critical path delay minimization.

[1]  Xianlong Hong,et al.  Performance-Driven Steiner Tree Algorithms for Global Routing , 1993, 30th ACM/IEEE Design Automation Conference.

[2]  Xianlong Hong,et al.  An Efficient Timing-Driven Global Routing Algorithm , 1993, 30th ACM/IEEE Design Automation Conference.

[3]  Pak K. Chan,et al.  Computing Signal Delay in General RC Networks by Tree/Link Partitioning , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  W. C. Elmore The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[5]  T. Sakurai,et al.  Approximation of wiring delay in MOSFET LSI , 1983, IEEE Journal of Solid-State Circuits.