메뉴 건너뛰기




Volumn 18, Issue 2-3, 1999, Pages 346-356

Creating small fault dictionaries

Author keywords

Data compression fault modeling; Fault dictionaries; Logic circuit fault diagnosis

Indexed keywords

DATA COMPRESSION FAULT MODELING; FAULT DICTIONARIES;

EID: 0033092663     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.748164     Document Type: Article
Times cited : (75)

References (23)
  • 3
    • 84869995409 scopus 로고    scopus 로고
    • Fault model evolution for diagnosis: Accuracy vs precision, in 1992, pp. 776-792.
    • _, Fault model evolution for diagnosis: Accuracy vs precision, in Proc. Custom Integrated Circuits Conf., 1992, pp. 776-792.
    • Proc. Custom Integrated Circuits Conf.
  • 4
    • 0029244675 scopus 로고    scopus 로고
    • Better models or better algorithms? o techniques to improve fault diagnosis
    • R. C. Aitken and P. C. Maxwell, Better models or better algorithms? o techniques to improve fault diagnosis, Hewlett-Packard J., Feb. 1995.
    • Hewlett-Packard J., Feb. 1995.
    • Aitken, R.C.1    Maxwell, P.C.2
  • 6
    • 0029721859 scopus 로고    scopus 로고
    • Full fault dictionary storag based on labeled tree encoding, in 1996, pp 174-179.
    • V. Boppana, I. Hartanto, and W. K. Fuchs, Full fault dictionary storag based on labeled tree encoding, in Proc. VLSI Test Symp., 1996, pp 174-179.
    • Proc. VLSI Test Symp.
    • Boppana, V.1    Hartanto, I.2    Fuchs, W.K.3
  • 7
    • 33747475588 scopus 로고    scopus 로고
    • A block-sorting lossless data compression algorithm, Digital Equipment Corp., Systems Research Center Palo Alto, CA, Tech. Rep. 124, 1994.
    • M. Burrows and D. J. Wheeler, A block-sorting lossless data compression algorithm, Digital Equipment Corp., Systems Research Center Palo Alto, CA, Tech. Rep. 124, 1994.
    • Burrows, M.1    Wheeler, D.J.2
  • 8
    • 0032025009 scopus 로고    scopus 로고
    • Logic testing of bridging faults in CMO integrated circuits, 338-345, Mar. 1998.
    • B. Chess and T. Larrabee, Logic testing of bridging faults in CMO integrated circuits, IEEE Trans. Comput., pp. 338-345, Mar. 1998.
    • IEEE Trans. Comput., Pp.
    • Chess, B.1    Larrabee, T.2
  • 10
    • 0026220880 scopus 로고    scopus 로고
    • Physically realistic fault models for analo CMOS neural networks, vol. 26, no. 9 pp. 1223-1229, Sept. 1991.
    • D. Feltham and W. Maly, Physically realistic fault models for analo CMOS neural networks, IEEE J. Solid-State Circuits, vol. 26, no. 9 pp. 1223-1229, Sept. 1991.
    • IEEE J. Solid-State Circuits
    • Feltham, D.1    Maly, W.2
  • 11
    • 33747467575 scopus 로고    scopus 로고
    • Carafe: An inductive fault analysis tool fo CMOS VLSI circuits, in 1993, pp. 92-98.
    • A. Jee and F. J. Ferguson, Carafe: An inductive fault analysis tool fo CMOS VLSI circuits, in Proc. IEEE VLSI Test Symp., 1993, pp. 92-98.
    • Proc. IEEE VLSI Test Symp.
    • Jee, A.1    Ferguson, F.J.2
  • 12
    • 0026623575 scopus 로고    scopus 로고
    • Test pattern generation using Boolean satisfiability, 4-15, Jan. 1992.
    • T. Larrabee, Test pattern generation using Boolean satisfiability, IEE Trans. Computer-Aided Design, pp. 4-15, Jan. 1992.
    • IEE Trans. Computer-Aided Design, Pp.
    • Larrabee, T.1
  • 17
    • 0027868460 scopus 로고    scopus 로고
    • Fault dictionary compression and equivalence class computation for sequential circuits, in 1993, pp. 508-511.
    • P. G. Ryan, W. K. Fuchs, and I. Pomeranz, Fault dictionary compression and equivalence class computation for sequential circuits, in Proc Int. Conf. on Computer-Aided Design, 1993, pp. 508-511.
    • Proc Int. Conf. on Computer-Aided Design
    • Ryan, P.G.1    Fuchs, W.K.2    Pomeranz, I.3
  • 20
    • 0021439618 scopus 로고    scopus 로고
    • A technique for high-performance data compression, 17, pp. 8-19, June 1984.
    • T. A. Welch, A technique for high-performance data compression, IEEE Comput., vol. C17, pp. 8-19, June 1984.
    • IEEE Comput., Vol. C
    • Welch, T.A.1
  • 21
    • 0017493286 scopus 로고    scopus 로고
    • A universal algorithm for sequential dat compression, 23, pp. 337-343 May 1977.
    • J. Ziv and A. Lempel, A universal algorithm for sequential dat compression, IEEE Trans. Inform. Theory, vol. IT23, pp. 337-343 May 1977.
    • IEEE Trans. Inform. Theory, Vol. IT
    • Ziv, J.1    Lempel, A.2
  • 22
    • 0018019231 scopus 로고    scopus 로고
    • Compression of individual sequences via variable rate coding, 24, pp. 530-535, Sept. 1978.
    • _, Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Theory, vol. IT24, pp. 530-535, Sept. 1978.
    • IEEE Trans. Inform. Theory, Vol. IT
  • 23
    • 33747487468 scopus 로고    scopus 로고
    • A neutral netlist of 10 combinationa benchmark circuits and a target translator in fortran, presented at
    • F. Brglez and H. Fujiwara, A neutral netlist of 10 combinationa benchmark circuits and a target translator in fortran, presented at IEE Int. Symp. on Circuits and Systems, 1985.
    • IEE Int. Symp. on Circuits and Systems, 1985.
    • Brglez, F.1    Fujiwara, H.2


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