Timing-driven Steiner tree construction with buffer insertion

In this paper, given a set of connecting nodes in a signal net, based on the concept of sharing-buffer insertion and hidden Steiner-point assignment, an effective timing-driven rectilinear Steiner tree with buffer insertion (TRST/BI) approach is proposed to construct a timing-driven rectilinear Steiner tree by introducing sharing-buffers and hidden Steiner points onto feasible positions. The experimental results show that our proposed TRST/BI approach obtains better timing-driven Steiner trees than our previous TRST approach for the tested signal nets