• DocumentCode
    1299162
  • Title

    Analysis of detection probability and some applications

  • Author

    David, René ; Wagner, Kenneth

  • Author_Institution
    Standford Univ., CA, USA
  • Volume
    39
  • Issue
    10
  • fYear
    1990
  • fDate
    10/1/1990 12:00:00 AM
  • Firstpage
    1284
  • Lastpage
    1291
  • Abstract
    Test-pattern generation for high fault coverage is an expensive and time-consuming process. As an alternative circuits can be tested by applying random or pseudorandom patterns. To analyze random testing without fault simulation, the number of vectors that detect a fault in each fault class must be enumerated. A fault-detection function whose number of minterms is identical to the fault detectability is constructed. Extensions are made to the Cutting algorithm to evaluate the signal probability of the detection or its bounding functions. The signal probability can then be converted easily into an exact detectability or narrow detectability range associated with each fault
  • Keywords
    fault tolerant computing; integrated circuit testing; logic testing; probability; Cutting algorithm; bounding functions; circuit testing; detection probability analysis; exact detectability; fault coverage; fault detectability; fault-detection function; minterms; narrow detectability; pseudorandom patterns; random patterns; random testing; signal probability; test pattern generation; vectors; Automatic testing; Built-in self-test; Circuit faults; Circuit simulation; Circuit testing; Combinational circuits; Electrical fault detection; Fault detection; System testing; Vectors;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.59858
  • Filename
    59858