메뉴 건너뛰기




Volumn , Issue , 2008, Pages 624-631

Statistical path selection for at-speed test

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CHIP DESIGNS; DELAY CHANGES; FAULT MODELS; OPEN PROBLEMS; PARAMETRIC VARIATIONS; PATH SELECTIONS; PATH TRACINGS; PROCESS VARIATIONS; SPACE COVERAGES; SPEED TESTS;

EID: 57849101587     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2008.4681642     Document Type: Conference Paper
Times cited : (29)

References (12)
  • 1
    • 39749176233 scopus 로고    scopus 로고
    • V. Iyengar, T. Yokota, K. Yamada, T. Anemikos, R. Bassett, M. Degregorio, R. Farmer, G. Grise, M. Johnson, D. Milton, M. Taylor, and F. Woytowich. At-speed structural test for high-performance ASICs. Proc. International Test Conference, pages 2.4:1-10, October 2006. Santa Clara, CA.
    • V. Iyengar, T. Yokota, K. Yamada, T. Anemikos, R. Bassett, M. Degregorio, R. Farmer, G. Grise, M. Johnson, D. Milton, M. Taylor, and F. Woytowich. At-speed structural test for high-performance ASICs. Proc. International Test Conference, pages 2.4:1-10, October 2006. Santa Clara, CA.
  • 2
    • 84948408811 scopus 로고    scopus 로고
    • Novel techniques for achieving high at-speed transition fault test coverage for Motorola's microprocessors based on PowerPC instruction set architecture
    • April, Monterey, CA
    • N. Tendolkar, R. Raina. R. Woltenberg, X. Lin, B. Swanson, and G. Aldrich. Novel techniques for achieving high at-speed transition fault test coverage for Motorola's microprocessors based on PowerPC instruction set architecture. IEEE VLSI Test Symposium, pages 3-8, April 2002. Monterey, CA.
    • (2002) IEEE VLSI Test Symposium , pp. 3-8
    • Tendolkar, N.1    Raina, R.2    Woltenberg, R.3    Lin, X.4    Swanson, B.5    Aldrich, G.6
  • 6
    • 0036443068 scopus 로고    scopus 로고
    • Finding a small set of longest testable paths that cover every gate
    • October, Baltimore, MD
    • M. Sharma and J. H. Patel. Finding a small set of longest testable paths that cover every gate. International Test Conference, pages 974-982, October 2002. Baltimore, MD.
    • (2002) International Test Conference , pp. 974-982
    • Sharma, M.1    Patel, J.H.2
  • 7
    • 0036049286 scopus 로고    scopus 로고
    • False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
    • 7, June, New Orleans, LA
    • |7] J-J. Liou. A. Krstic, L-C. Wang, and K-T. Cheng. False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation. Proc. 2002 Design Automation Conference, pages 566-569, June 2002. New Orleans, LA.
    • (2002) Proc. 2002 Design Automation Conference , pp. 566-569
    • Liou, J.-J.1    Krstic, A.2    Wang, L.-C.3    Cheng, K.-T.4
  • 8
    • 0142246911 scopus 로고    scopus 로고
    • W. Qiu and D. M. H. Walker. An efficient algorithm for finding k longest testable paths through each gate in a combinational circuit. International Test Conference, pages 592-601, Setpember 2003. Charlotte. NC.
    • W. Qiu and D. M. H. Walker. An efficient algorithm for finding k longest testable paths through each gate in a combinational circuit. International Test Conference, pages 592-601, Setpember 2003. Charlotte. NC.
  • 10
    • 0346778721 scopus 로고    scopus 로고
    • Statistical timing analysis considering spatial correlations using a single PERT-like traversal
    • November, San Jose, CA
    • H. Chang and S. S. Sapatnekar. Statistical timing analysis considering spatial correlations using a single PERT-like traversal. IEEE International Conference on Computer-Aided Design, pages 621-625, November 2003. San Jose, CA.
    • (2003) IEEE International Conference on Computer-Aided Design , pp. 621-625
    • Chang, H.1    Sapatnekar, S.S.2
  • 11
    • 4243666444 scopus 로고    scopus 로고
    • Network timing analysis method which eliminates timing variations between signals traversing a common circuit path.
    • U. S. Patent 5,636,372, June
    • D. J. Hathaway, J. P. Alvarez, and K. P. Belkhale. Network timing analysis method which eliminates timing variations between signals traversing a common circuit path. U. S. Patent 5,636,372, June 1997.
    • (1997)
    • Hathaway, D.J.1    Alvarez, J.P.2    Belkhale, K.P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.