Azadeh Davoodi, Jiang Hu, et al.
IEEE TCADIS
Buffer insertion is essential for achieving timing closure. This work studies buffer insertion under two types of constraints: (i) avoiding blockages, and (ii) inserting buffers into pre-determined buffer bay regions. We propose a general Steiner tree routing problem to drive this application and present a maze-routing based heuristic. We show that this approach leads to useful solutions on industry designs.
Azadeh Davoodi, Jiang Hu, et al.
IEEE TCADIS
Charles J. Alpert, Andrew B. Kahng
Journal of Classification
He Zhou, Sunil P. Khatri, et al.
ASP-DAC 2020
C.N. Sze, Jiang Hu, et al.
ASP-DAC 2004