A fast algorithm for critical path tracing in VLSI digital circuits Conference Paper uri icon

abstract

  • 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. 2005 IEEE.

name of conference

  • 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05)

published proceedings

  • DFT 2005: 20TH IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI SYSTEMS

author list (cited authors)

  • Wu, L., & Walker, D.

citation count

  • 23

complete list of authors

  • Wu, L||Walker, DMH

publication date

  • January 1, 2005 11:11 AM