메뉴 건너뛰기




Volumn 24, Issue 12, 2005, Pages 1924-1929

Longest-path selection for delay test under process variation

Author keywords

Delay test; Interconnect; Optimization; Timing analysis

Indexed keywords

DEFECTS; ELECTRIC POWER SYSTEM INTERCONNECTION; ELECTRONIC EQUIPMENT MANUFACTURE; OPTIMIZATION; PROBLEM SOLVING;

EID: 29144439093     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.852674     Document Type: Conference Paper
Times cited : (34)

References (18)
  • 1
    • 0036732498 scopus 로고    scopus 로고
    • Resistance characterization for weak open defects
    • Sep.
    • R. R. Montanes, J. P. de Gyvez, and P. Volf, "Resistance characterization for weak open defects," IEEE Des. Test. Comput., vol. 19, no. 5, pp. 18-25, Sep. 2002.
    • (2002) IEEE Des. Test. Comput. , vol.19 , Issue.5 , pp. 18-25
    • Montanes, R.R.1    De Gyvez, J.P.2    Volf, P.3
  • 5
    • 0036443068 scopus 로고    scopus 로고
    • Finding a small set of longest testable paths that cover every gate
    • Baltimore, MD, Oct.
    • M. Sharma and J. H. Patel, "Finding a small set of longest testable paths that cover every gate," in IEEE Int. Test Conf., Baltimore, MD, Oct. 2002, pp. 974-982.
    • (2002) IEEE Int. Test Conf. , pp. 974-982
    • Sharma, M.1    Patel, J.H.2
  • 6
    • 0035273034 scopus 로고    scopus 로고
    • Path delay fault diagnosis and coverage - A metric and an estimation technique
    • Mar.
    • M. Sivaraman and A. J. Strojwas, "Path delay fault diagnosis and coverage - A metric and an estimation technique," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 20, no. 3, pp. 440-457, Mar. 2001.
    • (2001) IEEE Trans. Comput.-aided Des. Integr. Circuits Syst. , vol.20 , Issue.3 , pp. 440-457
    • Sivaraman, M.1    Strojwas, A.J.2
  • 7
    • 0026175109 scopus 로고
    • The interdependence between delay optimization of synthesized networks and testing
    • San Francisco, CA, Jun.
    • T. W. Williams, B. Underwood, and M. R. Mercer, "The interdependence between delay optimization of synthesized networks and testing," in ACM/IEEE Design Automation Conf., San Francisco, CA, Jun. 1991, pp. 87-92.
    • (1991) ACM/IEEE Design Automation Conf. , pp. 87-92
    • Williams, T.W.1    Underwood, B.2    Mercer, M.R.3
  • 8
    • 0030395005 scopus 로고    scopus 로고
    • Test generation for global delay faults
    • Washington, DC, Oct.
    • G. M. Luong and D. M. H. Walker, "Test generation for global delay faults," in IEEE Int. Test Conf., Washington, DC, Oct. 1996, pp. 433-442.
    • (1996) IEEE Int. Test Conf. , pp. 433-442
    • Luong, G.M.1    Walker, D.M.H.2
  • 9
    • 0032318723 scopus 로고    scopus 로고
    • Efficient path selection for delay testing based on partial path evaluation
    • Princeton, NJ, Apr.
    • S. Tani, M. Teramoto, T. Fukazawa, and K. Matsuhiro, "Efficient path selection for delay testing based on partial path evaluation," in IEEE VLSI Test Symp., Princeton, NJ, Apr. 1998, pp. 188-193.
    • (1998) IEEE VLSI Test Symp. , pp. 188-193
    • Tani, S.1    Teramoto, M.2    Fukazawa, T.3    Matsuhiro, K.4
  • 10
    • 0036049286 scopus 로고    scopus 로고
    • False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
    • New Orleans, LA, Jun.
    • 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," in ACM/IEEE Design Automation Conf., New Orleans, LA, Jun. 2002, pp. 566-569.
    • (2002) ACM/IEEE Design Automation Conf. , pp. 566-569
    • Liou, J.J.1    Krstic, A.2    Wang, L.C.3    Cheng, K.T.4
  • 11
    • 29144526368 scopus 로고    scopus 로고
    • On path selection for delay fault testing considering operating conditions
    • Maastricht, Netherlands, May
    • B. Seshadri, I. Pomeranz, S. M. Reddy, and S. Kundu, "On path selection for delay fault testing considering operating conditions," in IEEE European Test Workshop, Maastricht, Netherlands, May 2003, pp.141-146.
    • (2003) IEEE European Test Workshop , pp. 141-146
    • Seshadri, B.1    Pomeranz, I.2    Reddy, S.M.3    Kundu, S.4
  • 12
    • 0031077147 scopus 로고    scopus 로고
    • Analysis and decomposition of spatial variation in integrated circuit process and devices
    • Feb.
    • B. Stine, D. Boning, and J. Chung, "Analysis and decomposition of spatial variation in integrated circuit process and devices," IEEE Trans. Semicond. Manuf., vol. 10, no. 1, pp. 24-41, Feb. 1997.
    • (1997) IEEE Trans. Semicond. Manuf. , vol.10 , Issue.1 , pp. 24-41
    • Stine, B.1    Boning, D.2    Chung, J.3
  • 13
    • 0034833288 scopus 로고    scopus 로고
    • Modeling and analysis of manufacturing variations
    • San Diego, CA, May
    • S. R. Nassif, "Modeling and analysis of manufacturing variations," in IEEE Custom Integrated Circuits Conf., San Diego, CA, May 2001, pp.223-228.
    • (2001) IEEE Custom Integrated Circuits Conf. , pp. 223-228
    • Nassif, S.R.1
  • 15
    • 0023964171 scopus 로고
    • Applications of statistical design and response surface methods to computed aided VLSI device design
    • Feb.
    • A. R. Alvarez, B. L. Abdi, D. L. Young, H. D. Weed, J. Teplik, and E. R. Herald, "Applications of statistical design and response surface methods to computed aided VLSI device design," in ACM/IEEE Design Automation Conf., Feb. 1988, vol. 7, no. 2, pp. 272-287.
    • (1988) ACM/IEEE Design Automation Conf. , vol.7 , Issue.2 , pp. 272-287
    • Alvarez, A.R.1    Abdi, B.L.2    Young, D.L.3    Weed, H.D.4    Teplik, J.5    Herald, E.R.6
  • 16
    • 0020845843 scopus 로고
    • Linear programming in linear time when the dimension is fixed
    • Jan.
    • N. Megiddo, "Linear programming in linear time when the dimension is fixed," J. ACM, vol. 31, no. 1, pp. 114-127, Jan. 1984.
    • (1984) J. ACM , vol.31 , Issue.1 , pp. 114-127
    • Megiddo, N.1
  • 17
    • 0142246911 scopus 로고    scopus 로고
    • An efficient algorithm for finding the K longest testable paths through each gate in a combinational circuit
    • Charlotte, NC, Oct.
    • W. Qiu and D. M. H. Walker, "An efficient algorithm for finding the K longest testable paths through each gate in a combinational circuit," in IEEE Int. Test Conf., Charlotte, NC, Oct. 2003, pp. 592-601.
    • (2003) IEEE Int. Test Conf. , pp. 592-601
    • Qiu, W.1    Walker, D.M.H.2
  • 18
    • 18144381267 scopus 로고    scopus 로고
    • K longest paths per gate (KLPG) test generation for scan-based sequential circuits
    • Charlotte, NC, Oct.
    • W. Qiu, J. Wang, D. M. H. Walker, D. Reddy, X. Lu, Z. Li, W. Shi, and H. Balachandran, "K longest paths per gate (KLPG) test generation for scan-based sequential circuits," in IEEE Int. Test Conf, Charlotte, NC, Oct. 2004, pp. 223-231.
    • (2004) IEEE Int. Test Conf , pp. 223-231
    • Qiu, W.1    Wang, J.2    Walker, D.M.H.3    Reddy, D.4    Lu, X.5    Li, Z.6    Shi, W.7    Balachandran, H.8


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