loading...
A Fast Algorithm for Critical Path Tracing in VLSI Digital Circuits
Monterey, California October 03-October 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DFTVS.2005.620th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lei Wu, Texas A&M University
D. M. H. Walker, Texas A&M University

An exact, linear-time critical path tracing algorithm is presented. The performance of critical path tracing is determined primarily by the efficiency of stem analysis. The proposed strategy can determine stem criticality in one pass based on six rules. Experiments on ISCAS85 and ISCAS89 benchmark circuits show that the computation time is nearly linear in the number of nets.

Citation:
Lei Wu, D. M. H. Walker, "A Fast Algorithm for Critical Path Tracing in VLSI Digital Circuits," dft, pp.178-186, 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.