NobleBlocks

Research indexJournal article

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

Edahiro, Lipton

23 Dec 2002

NobleIDark:/48914/w1/20260521/1EBA6F11DOI10.1109/glsv.1996.497610

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

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.

Discussion

Citations

Topics

More

Suggest a correction or report