PREANALYSIS FOR THE FULL RANGE CUTTING ALGORITHM.

V. Gupta, Jacob Savir

Research output: Contribution to journalArticlepeer-review

Abstract

This article describes a technique which may be used to collect the information necessary to perform the full range cutting algorithm. The cutting algorithm is a means of bounding the signal probability and detection probability of faults in a combinational circuit. It allows an early identification of 'hard to detect faults', and indicates where a circuit modification is required in order to meet a given test quality specification. There are two versions of the cutting algorithm: the full range, and the partial range. The difference between the two is that the full range is using intervals of left bracket 0, 1 right bracket , while the partial range is using shorter intervals.

Original languageEnglish (US)
Pages (from-to)3859-3862
Number of pages4
JournalIBM technical disclosure bulletin
Volume27
Issue number7 A
StatePublished - Dec 1 1984
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'PREANALYSIS FOR THE FULL RANGE CUTTING ALGORITHM.'. Together they form a unique fingerprint.

Cite this