The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Le but d'un programme d'analyse de testabilité est d'estimer la difficulté de tester un défaut. Une bonne mesure peut donner une alerte précoce sur le problème de test afin de fournir des conseils pour améliorer la testabilité d'un circuit. Des recherches ont tenté de calculer efficacement l'analyse de testabilité. Parmi ceux-ci, la procédure de contrôlabilité et d'observabilité COP peut calculer efficacement la valeur de testabilité d'un défaut coincé dans un circuit structuré en arborescence, mais peut être très imprécise pour un circuit général. L'imprécision du COP est due à la méconnaissance des corrélations des signaux. Récemment, l'algorithme de TAIR dans [5] propose un algorithme d'analyse de testabilité, qui part du résultat du COP puis améliore progressivement le résultat en appliquant un ensemble de règles. L'ensemble de règles de TAIR peut capturer certaines corrélations de signaux et les résultats de TAIR sont donc plus précis que ceux de COP. Dans cet article, nous prouvons d'abord que les règles de TAIR peuvent être remplacées par une formulation fermée. Ensuite, sur la base de la formulation sous forme fermée, nous avons proposé deux nouvelles techniques pour améliorer encore les résultats de l'analyse de testabilité. Nos résultats expérimentaux ont montré une amélioration par rapport aux résultats de TAIR.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yin-He SU, Ching-Hwa CHENG, Shih-Chieh CHANG, "Novel Techniques for Improving Testability Analysis" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 12, pp. 2901-2912, December 2002, doi: .
Abstract: The purpose of a testability analysis program is to estimate the difficulty of testing a fault. A good measurement can give an early warning about the testing problem so as to provide guidance in improving the testability of a circuit. There have been researches attempting to efficiently compute the testability analysis. Among those, the Controllability and Observability Procedure COP can calculate the testability value of a stuck-at fault efficiently in a tree-structured circuit but may be very inaccurate for a general circuit. The inaccuracy in COP is due to the ignorance of signal correlations. Recently, the algorithm of TAIR in [5] proposes a testability analysis algorithm, which starts from the result of COP and then gradually improves the result by applying a set of rules. The set of rules in TAIR can capture some signal correlations and therefore the results of TAIR are more accurate than COP. In this paper, we first prove that the rules in TAIR can be replaced by a closed-form formulation. Then, based on the closed-form formulation, we proposed two novel techniques to further improve the testability analysis results. Our experimental results have shown improvement over the results of TAIR.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_12_2901/_p
Copier
@ARTICLE{e85-a_12_2901,
author={Yin-He SU, Ching-Hwa CHENG, Shih-Chieh CHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Novel Techniques for Improving Testability Analysis},
year={2002},
volume={E85-A},
number={12},
pages={2901-2912},
abstract={The purpose of a testability analysis program is to estimate the difficulty of testing a fault. A good measurement can give an early warning about the testing problem so as to provide guidance in improving the testability of a circuit. There have been researches attempting to efficiently compute the testability analysis. Among those, the Controllability and Observability Procedure COP can calculate the testability value of a stuck-at fault efficiently in a tree-structured circuit but may be very inaccurate for a general circuit. The inaccuracy in COP is due to the ignorance of signal correlations. Recently, the algorithm of TAIR in [5] proposes a testability analysis algorithm, which starts from the result of COP and then gradually improves the result by applying a set of rules. The set of rules in TAIR can capture some signal correlations and therefore the results of TAIR are more accurate than COP. In this paper, we first prove that the rules in TAIR can be replaced by a closed-form formulation. Then, based on the closed-form formulation, we proposed two novel techniques to further improve the testability analysis results. Our experimental results have shown improvement over the results of TAIR.},
keywords={},
doi={},
ISSN={},
month={December},}
Copier
TY - JOUR
TI - Novel Techniques for Improving Testability Analysis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2901
EP - 2912
AU - Yin-He SU
AU - Ching-Hwa CHENG
AU - Shih-Chieh CHANG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2002
AB - The purpose of a testability analysis program is to estimate the difficulty of testing a fault. A good measurement can give an early warning about the testing problem so as to provide guidance in improving the testability of a circuit. There have been researches attempting to efficiently compute the testability analysis. Among those, the Controllability and Observability Procedure COP can calculate the testability value of a stuck-at fault efficiently in a tree-structured circuit but may be very inaccurate for a general circuit. The inaccuracy in COP is due to the ignorance of signal correlations. Recently, the algorithm of TAIR in [5] proposes a testability analysis algorithm, which starts from the result of COP and then gradually improves the result by applying a set of rules. The set of rules in TAIR can capture some signal correlations and therefore the results of TAIR are more accurate than COP. In this paper, we first prove that the rules in TAIR can be replaced by a closed-form formulation. Then, based on the closed-form formulation, we proposed two novel techniques to further improve the testability analysis results. Our experimental results have shown improvement over the results of TAIR.
ER -