Abstract-In this paper, selection of test nodes has been studied extensively and efficient techniques are proposed. Two broad categories of methods called inclusion methods and exclusion methods are suggested. Strategies are presented to select or delete a test node without affecting the diagnosis capabilities. Examples show that these strategies give less number of test nodes some times. Starting from the fault-wise integer coded table of the test circuit, sorting is employed to generate valid sets and minimal sets. The order of computation of these methods is shown to depend linearly on number of test nodes. It is also proportional to (/ log f) where "" is the number of faults. This is much faster than well-known methods. The concept of minimal set of test nodes is new in analog circuit fault diagnosis. Polynomial time algorithms are proposed in this paper for the first time to generate such sets.
Prasad and Babu REF proposed the concept of minimal set of test nodes in analog circuit fault diagnosis, and proposed polynomial time algorithms for the first time to generate such sets.
Selection of Test Nodes for Analog Fault Diagnosis in Dictionary Approach
Computer Science