Maximizing Stuck-Open Fault Coverage Using Stuck-at Test Vectors
| Autor: | Shin-ya Kobayashi, Hiroshi Takahashi, Yuzo Takamatsu, Kewal K. Saluja, Yoshinobu Higami |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Computer science
Applied Mathematics Real-time computing Bridging fault Test compression Hardware_PERFORMANCEANDRELIABILITY Automatic test pattern generation Computer Graphics and Computer-Aided Design Stuck-at fault Test vector Test set Signal Processing Fault coverage Electrical and Electronic Engineering Fault model Algorithm Hardware_LOGICDESIGN |
| Zdroj: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :3506-3513 |
| ISSN: | 1745-1337 0916-8508 |
| Popis: | Physical defects that are not covered by stuck-at fault or bridging fault model are increasing in LSI circuits designed and manufactured in modern Deep Sub-Micron (DSM) technologies. Therefore, it is necessary to target non-stuck-at and non-bridging faults. A stuck-open is one such fault model that captures transistor level defects. This paper presents two methods for maximizing stuck-open fault coverage using stuck-at test vectors. In this paper we assume that a test set to detect stuck-at faults is given and we consider two formulations for maximizing stuck-open coverage using the given test set as follows. The first problem is to form a test sequence by using each test vector multiple times, if needed, as long as the stuck-open coverage is increased. In this case the target is to make the resultant test sequence as short as possible under the constraint that the maximum stuck-open coverage is achieved using the given test set. The second problem is to form a test sequence by using each test vector exactly once only. Thus in this case the length of the test sequence is maintained as the number of given test vectors. In both formulations the stuck-at fault coverage does not change. The effectiveness of the proposed methods is established by experimental results for benchmark circuits. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|