메뉴 건너뛰기




Volumn 26, Issue 1-2, 1998, Pages 197-209

On-line testing for VLSI: State of the art and trends

Author keywords

Deep submicron scaling; Fail safe circuits; Hardware fault tolerance; On line current monitoring; On line testing; Perturbation hardened circuits; Self checking circuits; Soft errors

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER AIDED SOFTWARE ENGINEERING; ELECTRIC CURRENTS; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; INTEGRATED CIRCUIT TESTING; ONLINE SYSTEMS; PERTURBATION TECHNIQUES;

EID: 0032315090     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(98)00028-5     Document Type: Article
Times cited : (37)

References (54)
  • 1
    • 0001305152 scopus 로고
    • Design of dynamically checked computers
    • Edinburgh, Scotland, 5-10 Aug.
    • W.C., Carter, P.R. Schneider, Design of dynamically checked computers, Proc. 4th Congress IFIP, vol.2, Edinburgh, Scotland, 5-10 Aug. 1968, pp. 878-883.
    • (1968) Proc. 4th Congress IFIP , vol.2 , pp. 878-883
    • Carter, W.C.1    Schneider, P.R.2
  • 3
    • 0017982079 scopus 로고
    • Strongly fault secure logic networks
    • J.E. Smith, G. Metze, Strongly fault secure logic networks, IEEE Trans. Comput. C-27 (6) (1978).
    • (1978) IEEE Trans. Comput. , vol.C-27 , Issue.6
    • Smith, J.E.1    Metze, G.2
  • 4
    • 0001749167 scopus 로고
    • On checking an Adder
    • W.W. Peterson, On checking an Adder, IBM J. Res. Dev. 2 (1958) 166-168.
    • (1958) IBM J. Res. Dev. , vol.2 , pp. 166-168
    • Peterson, W.W.1
  • 5
    • 0015159063 scopus 로고
    • The STAR (Self-Testing and Repairing) computer: An investigation of the theory and practice of fault-tolerant computer design
    • A. Avizienis, G.C. Gilley, F.P. Mathur, D.A. Rennels, J.A. Rohr, D.K. Rubin, The STAR (Self-Testing and Repairing) computer: an investigation of the theory and practice of fault-tolerant computer design IEEE Trans. Comput. C-2O (1971) 1312-1321.
    • (1971) IEEE Trans. Comput. , vol.C-2O , pp. 1312-1321
    • Avizienis, A.1    Gilley, G.C.2    Mathur, F.P.3    Rennels, D.A.4    Rohr, J.A.5    Rubin, D.K.6
  • 6
    • 0015631041 scopus 로고
    • Arithmetic algorithms for error-coded operands
    • A. Avizienis, Arithmetic algorithms for error-coded operands IEEE Trans. Comput. C-22 (6) (1973) 567-572.
    • (1973) IEEE Trans. Comput. , vol.C-22 , Issue.6 , pp. 567-572
    • Avizienis, A.1
  • 8
    • 0003035229 scopus 로고
    • A note on error detection codes for assymmetric binary channels
    • J.M. Berger, A note on error detection codes for assymmetric binary channels, Inform. Control. 4 (1961) 68-73.
    • (1961) Inform. Control. , vol.4 , pp. 68-73
    • Berger, J.M.1
  • 9
    • 50549172985 scopus 로고
    • Optimal error detection codes for completely asymmetric binary channels
    • C.V. Freiman, Optimal error detection codes for completely asymmetric binary channels, Inform. Control. 5 (1962) 64-71.
    • (1962) Inform. Control. , vol.5 , pp. 64-71
    • Freiman, C.V.1
  • 10
    • 84943817322 scopus 로고
    • Error detecting & correcting codes
    • R.W. Hamming, Error detecting & correcting codes, BST. J. 29 (1953) 147-160.
    • (1953) BST. J. , vol.29 , pp. 147-160
    • Hamming, R.W.1
  • 11
    • 0014823837 scopus 로고
    • A class of optimal minimum odd-weight-column SEC/DED codes
    • M.Y. Hsiao, A class of optimal minimum odd-weight-column SEC/DED codes, IBM. J. Res Develop. 14 (1970) 395-403.
    • (1970) IBM. J. Res Develop. , vol.14 , pp. 395-403
    • Hsiao, M.Y.1
  • 12
    • 0001174154 scopus 로고
    • Polynomial codes over certain finite fields
    • I.S. Reed, G. Solomon, Polynomial codes over certain finite fields, J. Soc. Ind. Appl. Math. 8 (1960) 300-304.
    • (1960) J. Soc. Ind. Appl. Math. , vol.8 , pp. 300-304
    • Reed, I.S.1    Solomon, G.2
  • 13
    • 50549175697 scopus 로고
    • On a class of error correcting binary group codes
    • R.C. Bose, D.K. Ray-Chaundhuri, On a class of error correcting binary group codes, Inform. Control 3 (1960) 68-79.
    • (1960) Inform. Control , vol.3 , pp. 68-79
    • Bose, R.C.1    Ray-Chaundhuri, D.K.2
  • 15
    • 0027844138 scopus 로고
    • Efficient implementation of self-checking adders and ALUs
    • Toulouse France, June
    • M. Nicolaidis, Efficient implementation of self-checking adders and ALUs, Proc. 23th Fault Tolerant Computing Symp., Toulouse France, June 1993.
    • (1993) Proc. 23th Fault Tolerant Computing Symp.
    • Nicolaidis, M.1
  • 19
    • 0347391899 scopus 로고    scopus 로고
    • A CAD framework for generating self-checking multipliers using residue arithmetic codes
    • Capri, Italy, July
    • I. Alzaher, M. Nicolaidis, A CAD framework for generating self-checking multipliers using residue arithmetic codes, 4th IEEE Intl. On-Line Testing Workshop, Capri, Italy, July 1998.
    • (1998) 4th IEEE Intl. On-Line Testing Workshop
    • Alzaher, I.1    Nicolaidis, M.2
  • 20
    • 0027961964 scopus 로고
    • On the effectiveness of residue code checking for parallel two's complement multipliers'
    • Austin Texas, June
    • U. Sparmann, S.M. Reddy, On the effectiveness of residue code checking for parallel two's complement multipliers' Proc. 24th Fault Tolerant Computing Symp., Austin Texas, June 1994.
    • (1994) Proc. 24th Fault Tolerant Computing Symp.
    • Sparmann, U.1    Reddy, S.M.2
  • 24
    • 0028457094 scopus 로고
    • RSYN: A system for automated synthesis of reliable multilevel circuits
    • K. De, C. Natarajan, D. Nair, P. Banerjee, RSYN: A system for automated synthesis of reliable multilevel circuits, IEEE Trans. VLSI Systems 2 (2) (1994) 186-195.
    • (1994) IEEE Trans. VLSI Systems , vol.2 , Issue.2 , pp. 186-195
    • De, K.1    Natarajan, C.2    Nair, D.3    Banerjee, P.4
  • 25
    • 0028728155 scopus 로고
    • Logic synthesis techniques for reduced area implementation of multilevel circuits with concurrent error detection
    • N.A. Touba, E.J. McCluskey, Logic synthesis techniques for reduced area implementation of multilevel circuits with concurrent error detection, Proc. Int. Conf. on Comp. Aided Design, 1994.
    • (1994) Proc. Int. Conf. on Comp. Aided Design
    • Touba, N.A.1    McCluskey, E.J.2
  • 26
    • 0008526188 scopus 로고    scopus 로고
    • The design of totally self-checking combinatorials circuits
    • Loss Angeless, USA, June
    • J.E. Smith, G. Metze, The design of totally self-checking combinatorials circuits, Proc. 7th Faylt Tolerant Computing Symp. Loss Angeless, USA, June 1997.
    • (1997) Proc. 7th Faylt Tolerant Computing Symp.
    • Smith, J.E.1    Metze, G.2
  • 27
    • 0015671134 scopus 로고
    • Monotone functions in sequential circuits
    • G. Mago, Monotone functions in sequential circuits, IEEE Trans. Comput. C-22 (10) (1973).
    • (1973) IEEE Trans. Comput. , vol.C-22 , Issue.10
    • Mago, G.1
  • 28
    • 84936893885 scopus 로고
    • Design of totally self-checking and fail-safe sequential machines
    • Urbana, IL
    • M. Diaz, Design of totally self-checking and fail-safe sequential machines, Proc. 4th Int. Fault Tolerant Computing Symp., Urbana, IL, 1974.
    • (1974) Proc. 4th Int. Fault Tolerant Computing Symp.
    • Diaz, M.1
  • 29
    • 0016027417 scopus 로고
    • On-set realization of fail-safe sequential machines
    • M. Diaz, J.C. Geffroy, M. Courvoisier, On-set realization of fail-safe sequential machines, IEEE Trans. Comput. C-23 (1974) 133-138.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 133-138
    • Diaz, M.1    Geffroy, J.C.2    Courvoisier, M.3
  • 30
    • 0008457060 scopus 로고
    • A note on strongly fault secure sequential circuits
    • T. Nanya, T. Kawamura, A note on strongly fault secure sequential circuits, IEEE Trans. Comput. C-36 (1987) 1121-1123.
    • (1987) IEEE Trans. Comput. , vol.C-36 , pp. 1121-1123
    • Nanya, T.1    Kawamura, T.2
  • 31
    • 0027610679 scopus 로고
    • Design and synthesis of self-checking VLSI circuits
    • N.K. Jha, S.-J. Wang, Design and synthesis of self-checking VLSI circuits, IEEE Trans. Comput. Aided Des. 12 (1993) 878-887.
    • (1993) IEEE Trans. Comput. Aided Des. , vol.12 , pp. 878-887
    • Jha, N.K.1    Wang, S.-J.2
  • 33
    • 0023399416 scopus 로고
    • Concurrent error detection in highly structured logic arrays
    • August
    • W.K. Fuchs, Ch.-H. Chien, J. Abraham, Concurrent error detection in highly structured logic arrays, IEEE J. Solid State Circuits SC-22 August (1987) 583-594.
    • (1987) IEEE J. Solid State Circuits , vol.SC-22 , pp. 583-594
    • Fuchs, W.K.1    Chien, Ch.-H.2    Abraham, J.3
  • 34
    • 0026852547 scopus 로고
    • An SFS berger check prediction ALU and its application to self-checking processors designs
    • J.-C. Lo, S. Thanawastien, T.R.N. Rao, M. Nicolaidis, An SFS berger check prediction ALU and its application to self-checking processors designs, IEEE Trans. Comput. Aided Des. II, (4) (1992).
    • (1992) IEEE Trans. Comput. Aided Des. , vol.2 , Issue.4
    • Lo, J.-C.1    Thanawastien, S.2    Rao, T.R.N.3    Nicolaidis, M.4
  • 37
    • 0023346714 scopus 로고
    • Design of fast self-testing checkers for berger codes
    • S.J. Piestrak, Design of fast self-testing checkers for berger codes, IEEE Trans. Comput. C-36 (1987) 629-634.
    • (1987) IEEE Trans. Comput. , vol.C-36 , pp. 629-634
    • Piestrak, S.J.1
  • 38
    • 0024140994 scopus 로고
    • The Design of fast totally self-checking berger code checkers based on berger code partitioning
    • Tokyo, Japan, June
    • J.-C. Lo, S. Thanawastien, The Design of fast totally self-checking berger code checkers based on berger code partitioning, in Proc. 18th Intl. Symp. on Fault Tolerant Computing, Tokyo, Japan, June 1988.
    • (1988) Proc. 18th Intl. Symp. on Fault Tolerant Computing
    • Lo, J.-C.1    Thanawastien, S.2
  • 39
    • 0025404142 scopus 로고
    • Design of high-speed and cost-effective self-testing checkers for low-cost arithmetic codes
    • S.J. Piestrak, Design of high-speed and cost-effective self-testing checkers for low-cost arithmetic codes, IEEE Trans. Comput. C-39 (1990) 360-374.
    • (1990) IEEE Trans. Comput. , vol.C-39 , pp. 360-374
    • Piestrak, S.J.1
  • 40
    • 0015604443 scopus 로고
    • Design of totally self-checking check circuits for m-out-of-n codes
    • D.A. Anderson, G. Metz, Design of totally self-checking check circuits for m-out-of-n codes, IEEE Trans. Comput. C-22 (1973) 263-269.
    • (1973) IEEE Trans. Comput. , vol.C-22 , pp. 263-269
    • Anderson, D.A.1    Metz, G.2
  • 41
    • 0008522626 scopus 로고
    • Easily testable cellular realization for tha (Exactly p)-out-of-n and (p or More)-out-of-n logic functions
    • S.M. Reddy, J.R. Wilson, Easily testable cellular realization for tha (Exactly p)-out-of-n and (p or More)-out-of-n logic functions, IEEE Trans. Comput. C-23 (1974) 98-100.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 98-100
    • Reddy, S.M.1    Wilson, J.R.2
  • 42
    • 0017983864 scopus 로고
    • Efficient design of self-checking checkers for any m-out-of-n codes
    • M.A. Marouf, A.D. Friedman, Efficient design of self-checking checkers for any m-out-of-n codes, IEEE Trans. Comput. C-27 (1978) 482-490.
    • (1978) IEEE Trans. Comput. , vol.C-27 , pp. 482-490
    • Marouf, M.A.1    Friedman, A.D.2
  • 43
    • 0020594652 scopus 로고
    • Design method of totally self-checking checkers for m-out-of-n codes
    • Milan, Italy, June
    • S.J. Piestrak, Design method of totally self-checking checkers for m-out-of-n codes, Proc. 13th Intl. Fault Tolerant Computing Symp., Milan, Italy, June 1983.
    • (1983) Proc. 13th Intl. Fault Tolerant Computing Symp.
    • Piestrak, S.J.1
  • 44
    • 0023963254 scopus 로고
    • Efficient modular design of TSC checkers for m-out-of-n Codes
    • A.M. Paschalis, D. Nikolos, C. Halatsis, Efficient modular design of TSC checkers for m-out-of-n Codes, IEEE Trans. Comput. C-37 (1988) 301-309.
    • (1988) IEEE Trans. Comput. , vol.C-37 , pp. 301-309
    • Paschalis, A.M.1    Nikolos, D.2    Halatsis, C.3
  • 45
    • 0026888758 scopus 로고
    • A general technique for designing totally self-checking checkers for 1-out-of-n Codes with minimum gate Delay
    • D.L. Tao, C.R.P. Hartmann, P.K. Lala, A general technique for designing totally self-checking checkers for 1-out-of-n Codes with minimum gate Delay, IEEE Trans, on Comput. C-41 (1992) 881-886.
    • (1992) IEEE Trans, on Comput. , vol.C-41 , pp. 881-886
    • Tao, D.L.1    Hartmann, C.R.P.2    Lala, P.K.3
  • 46
    • 0024864302 scopus 로고
    • Electrical properties and detection methods for CMOS IC defects
    • April
    • J.M. Soden, C.F. Hawkins, Electrical properties and detection methods for CMOS IC defects, Proc. 1st European Test Conf., April 1991.
    • (1991) Proc. 1st European Test Conf.
    • Soden, J.M.1    Hawkins, C.F.2
  • 47
    • 84939373653 scopus 로고
    • Computation of iddq current based on quality requirements
    • April Atlantic City, USA
    • F. Vargas, M. Nicolaidis, B. Hamdi, Computation of iddq current based on quality requirements, 11th IEEE VLSI Test Symp., April 1993, Atlantic City, USA.
    • (1993) 11th IEEE VLSI Test Symp.
    • Vargas, F.1    Nicolaidis, M.2    Hamdi, B.3
  • 52
    • 0347391900 scopus 로고    scopus 로고
    • A theory of perturbation tolerant asynchronous FSMs and its application on the design of perturbation tolerant memories
    • Cagliarri, 28-30 May
    • M. Nicolaidis, T. Calin, A theory of perturbation tolerant asynchronous FSMs and its application on the design of perturbation tolerant memories, 1997 European Test Workshop, Cagliarri, 28-30 May 1997.
    • (1997) 1997 European Test Workshop
    • Nicolaidis, M.1    Calin, T.2
  • 53
    • 0006843160 scopus 로고
    • Basic properties and a construction method for fail-safe logical systems
    • H. Mine, Y. Koga, Basic properties and a construction method for fail-safe logical systems, IEEE Trans. Electron. Comput. EC-16 (1967) 282-289.
    • (1967) IEEE Trans. Electron. Comput. , vol.EC-16 , pp. 282-289
    • Mine, H.1    Koga, Y.2


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