loading...
More Accurate Polynomial-Time Min-Max Timing Simulation
Eindhoven, THE NETHERLANDS April 07-April 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASYNC.1997.587168Third International Symposium on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Supratik Chakraborty, Stanford University
David L. Dill, Stanford University
We describe a polynomial-time algorithm for min-max timing simulation of combinational circuits. Our algorithm reports conservative bounds on the propagation delays from each primary input to each gate, for use in the timing verification of fundamental-mode asynchronous circuits. A new reconvergent fanout analysis technique is presented. Our algorithm produces more accurate results than previous polynomial-time (and some exponential-time) algorithms in the presence of reconvergent fanouts.
Index Terms:
Uncertain component delays, min-max timing simulation, polynomial-time algorithm, thirteen-valued signal algebra
Citation:
Supratik Chakraborty, David L. Dill, "More Accurate Polynomial-Time Min-Max Timing Simulation," async, pp.112, Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.