Buffer insertion in large circuits with constructive solution search techniques

Most existing buffer insertion algorithms, such as van Ginneken's algorithm, consider only individual nets. As a result, these algorithms tend to over buffer when applied to combinational circuits, since it is difficult to decide how many buffers to insert in each net. Recently, Sze, et al. (Sze, 2005) proposed a path-based algorithm for buffer insertion in combinational circuits. However their algorithm is inefficient for large circuits when there are many critical paths. In this paper, we present a new buffer insertion algorithm for combinational circuits such that the timing requirements are met and the buffer cost is minimized. Our algorithm iteratively inserts buffers in the circuit to improve the circuit delay. The core of this algorithm is simple but effective technique that guides the search for a good buffering solution. Experimental results on ISCAS85 circuits show that our new algorithm on average uses 36% less buffers and runs 3 times faster than Sze's algorithm

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

[2]  Conclusions , 1989 .

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

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

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

[6]  P. Glenn Gulak,et al.  A joint gate sizing and buffer insertion method for optimizing delay and power in CMOS and BiCMOS combinational logic , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Weiping Shi,et al.  Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost , 2004 .

[8]  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).

[9]  Weiping Shi,et al.  Path-Based Buffer Insertion , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Qiang Zhou,et al.  Path-based timing optimization by buffer insertion with accurate delay model , 2003, ASICON 2003.

[11]  Sachin S. Sapatnekar,et al.  Interleaving buffer insertion and transistor sizing into a single optimization , 1998, IEEE Trans. Very Large Scale Integr. Syst..

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

[13]  Hai Zhou,et al.  Efficient algorithms for buffer insertion in general circuits based on network flow , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..