By Topic

Application of Heuristic Graph Search to Test-Point Selection for Analog Fault Dictionary Techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
ChengLin Yang ; Sch. of Autom. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Shulin Tian ; Bing Long

The near-optimal test-point set selection for an analog fault dictionary is formulated as a heuristic depth-first graph search problem. Then, the test point selection process becomes a graph-node-expanding process. During the process of graph expansion, the information-theoretic concepts of entropy are used to develop the criterion for how to choose an intermediate node to expand. If a graph node has already isolated those faults that are hard isolate, then the residual faults can easily be isolated. The difficulty of isolating a given fault is evaluated by the information-theoretic concept of entropy. The harder that a fault is isolated, the larger the entropy value it will have. Statistical experimental results indicate that the proposed method more accurately finds the global minimum set of test points than other methods; therefore, it is a good solution to minimize the size of the test point set.

Published in:

Instrumentation and Measurement, IEEE Transactions on  (Volume:58 ,  Issue: 7 )