Clock buffer placement algorithm for wire-delay-dominated timing model

A clock buffer placement algorithm is proposed for future technologies in which wire delay dominates signal delay. In such technologies, buffers need to be placed so as to minimize the maximum wire delay. We formulate the problem into a non-linear programming, and solve it by an iteration method with a randomized technique. We applied our buffer placement algorithm with a zero-skew router to several benchmark data, and show that our algorithm achieves 30% less delay time than a H-tree based algorithm.

[1]  Masato Edahiro,et al.  An Efficient Zero-Skew Routing Algorithm , 1994, 31st Design Automation Conference.

[2]  Malgorzata Marek-Sadowska,et al.  Power optimal buffered clock tree design , 1995, DAC '95.

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

[4]  Chung-Kuan Cheng,et al.  Skew Sensitivity Minimization Of Buffered Clock Tree , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[5]  Lawrence T. Pillage,et al.  Skew And Delay Optimization For Reliable Buffered Clock Trees , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[6]  Chung-Kuan Cheng,et al.  Optimal wire sizing and buffer insertion for low power and a generalized delay model , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[7]  Wayne Wei-Ming Dai,et al.  Buffer insertion and sizing under process variations for low power clock distribution , 1995, DAC '95.

[8]  庄司 正一.  CMOS digital circuit technology , 1988 .

[9]  F. Minami,et al.  Clock Tree Synthesis Based On Rc Delay Balancing , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.