Timing-driven Steiner tree construction based on feasible assignment of hidden Steiner points

In this paper, given a set of connecting nodes in a signal net, based on the concept of movable Steiner points and the dining-driven flexibility of a Steiner point, it is assumed that all the Steiner points are initially hidden inside the connecting nodes in a shortest-path tree (SPT). An effective timing-driven rectilinear Steiner tree (TRST) approach is proposed to obtain a timing-driven rectilinear Steiner tree by introducing hidden Steiner points in a SPT onto feasible positions. The experimental results show that our proposed TRST approach obtains better timing-driven Steiner trees than the MVERT approach for the tested signal nets.