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
테스트 가능성 분석 프로그램의 목적은 결함 테스트의 어려움을 추정하는 것입니다. 좋은 측정은 테스트 문제에 대한 조기 경고를 제공하여 회로의 테스트 가능성을 향상시키는 데 지침을 제공할 수 있습니다. 테스트 가능성 분석을 효율적으로 계산하기 위한 연구가 진행되어 왔다. 그 중 Controllability and Observability Procedure COP는 트리 구조의 회로에서는 고착 결함의 테스트 가능성 값을 효율적으로 계산할 수 있지만 일반 회로에서는 매우 부정확할 수 있습니다. COP의 부정확성은 신호 상관관계를 모르기 때문에 발생합니다. 최근 [5]의 TAIR 알고리즘은 COP 결과로부터 시작하여 일련의 규칙을 적용하여 결과를 점진적으로 향상시키는 테스트 가능성 분석 알고리즘을 제안한다. TAIR의 규칙 세트는 일부 신호 상관관계를 포착할 수 있으므로 TAIR의 결과는 COP보다 더 정확합니다. 본 논문에서는 먼저 TAIR의 규칙이 폐쇄형 공식으로 대체될 수 있음을 증명합니다. 그런 다음 닫힌 형식 공식을 기반으로 테스트 가능성 분석 결과를 더욱 향상시키기 위한 두 가지 새로운 기술을 제안했습니다. 우리의 실험 결과는 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.
부
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
부
@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},}
부
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 -