loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th Great Lakes Symposium on VLSI
Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model
Ames, IA
March 22-March 23
ISBN: 0-8186-7502-0
Masato Edahiro, C&C Research Laboratories
Richard J. Lipton, Princeton University
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.
Index Terms:
VLSI, CAD, Layout, Clock, Buffer, Placement
Citation:
Masato Edahiro, Richard J. Lipton, "Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model," glsvlsi, pp.0143, 6th Great Lakes Symposium on VLSI, 1996
Usage of this product signifies your acceptance of the Terms of Use.