Random Pattern Testability

  • Authors:
  • Jacob Savir;Gary S. Ditlow;Paul H. Bardell

  • Affiliations:
  • IBM Data Systems Division, 265/415, Poughkeepsie NY 12602/ IBM T. J. Watson Research Center, Yorktown Heights, NY 10598.;IBM T. J. Watson Research Center, Yorktown Heights, NY 10598.;IBM Data Systems Division, 265/938, Poughkeepsie, NY 12602.

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1984

Quantified Score

Hi-index 15.01

Visualization

Abstract

A major problem in self testing with random inputs is verification of the test quality, i.e., the computation of the fault coverage. The brute-force approach of using full-fault simulation does not seem attractive because of the logic structure volume, and the CPU time encountered. A new approach is therefore necessary. This paper describes a new analytical method of computing the fault coverage that is fast compared with simulation. If the fault coverage falls below a certain threshold, it is possible to identify the ``random-pattern-resistant'' faults, modify the logic to make them easy to detect, and thus, increase the fault coverage of the random test.