An Efficient Analytical Approach to Path-Based Buffer Insertion

In this paper, an analytical approach to path-based buffer insertion is presented. Using the formulation, various objective functions in buffer costs can be minimized. Previous path-based buffer insertion algorithms either employ inaccurate delay estimation leading to an infeasible solution or process each path independently that may not use the effects of shared nets in paths and therefore, cannot optimize buffer cost efficiently. The approach was tested using ISCAS benchmarks. Experimental results show that our approach can satisfy timing constraints with a 46.69% reduction in the number of buffers. Reducing the number of the buffers can simultaneously reduce physical synthesis complexity as well as power consumption.

[1]  Jason Cong,et al.  Interconnect delay estimation models for synthesis and design planning , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[2]  Adnan Aziz,et al.  Meeting delay constraints in DSM by minimal repeater insertion , 2000, DATE '00.

[3]  Martin D. F. Wong,et al.  Closed form solution to simultaneous buffer insertion/sizing and wire sizing , 1997, ISPD '97.

[4]  L.P.P.P. van Ginneken,et al.  Buffer placement in distributed RC-tree networks for minimal Elmore delay , 1990 .

[5]  Chung-Kuan Cheng,et al.  Optimal wire sizing and buffer insertion for low power and a generalized delay model , 1995, ICCAD.

[6]  Charles J. Alpert,et al.  Buffer insertion for noise and delay optimization , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Martin D. F. Wong,et al.  A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Noel Menezes,et al.  Repeater scaling and its impact on CAD , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Weiping Shi,et al.  Buffer insertion in large circuits with constructive solution search techniques , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[10]  Weiping Shi,et al.  An O(nlogn) time algorithm for optimal buffer insertion , 2003, DAC '03.

[11]  Charles J. Alpert,et al.  A fast algorithm for identifying good buffer insertion candidate locations , 2004, ISPD '04.

[12]  Jiang Hu,et al.  Path-Based Buffer Insertion , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Charles J. Alpert,et al.  Wire segmenting for improved buffer insertion , 1997, DAC.

[14]  Hai Zhou,et al.  An efficient buffer insertion algorithm for large networks based on Lagrangian relaxation , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[15]  Charles J. Alpert,et al.  Buffer insertion for noise and delay optimization , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[16]  Mark A. Franklin,et al.  Optimum buffer circuits for driving long uniform lines , 1991 .

[17]  D. F. Wong,et al.  Closed form solutions to simultaneous buffer insertion/sizing and wire sizing , 2001, ACM Trans. Design Autom. Electr. Syst..

[18]  Jason Cong,et al.  Interconnect design for deep submicron ICs , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).