More Accurate Polynomial-Time Min-Max Timing Simulation

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Supratik Chakraborty Articles by David L. Dill

Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97)

Eindhoven, THE NETHERLANDS

April 07-April 10

ISBN: 0-8186-7922-0

	ASCII Text	x
	Supratik Chakraborty, David L. Dill, "More Accurate Polynomial-Time Min-Max Timing Simulation," Asynchronous Circuits and Systems, International Symposium on, pp. 112, Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997.

	BibTex	x
	@article{ 10.1109/ASYNC.1997.587168, author = {Supratik Chakraborty and David L. Dill}, title = {More Accurate Polynomial-Time Min-Max Timing Simulation}, journal ={Asynchronous Circuits and Systems, International Symposium on}, volume = {0}, year = {1997}, isbn = {0-8186-7922-0}, pages = {112}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASYNC.1997.587168}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asynchronous Circuits and Systems, International Symposium on TI - More Accurate Polynomial-Time Min-Max Timing Simulation SN - 0-8186-7922-0 SP EP A1 - Supratik Chakraborty, A1 - David L. Dill, PY - 1997 KW - Uncertain component delays KW - min-max timing simulation KW - polynomial-time algorithm KW - thirteen-valued signal algebra VL - 0 JA - Asynchronous Circuits and Systems, International Symposium on ER -

Supratik Chakraborty, Stanford University

David L. Dill, Stanford University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASYNC.1997.587168

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.