Abstract
Identification of bits that do not necessarily have to be specified in a test set can be beneficial to a number of applications, including low power test, test set encoding and embedding, and test set enriching with n-detect or other fault types properties. This work presents a new method for generating tests containing only a small number of specified bits, while keeping the number of total tests small. The method relies on finding a large number of faults that can be detected by a single test (compatible faults) with a small number of specified bits. Both the total number of specified bits in the test set as well as the number of specified bits per test are minimized. The obtained experimental results show that the proposed methodology can generate compact test sets with an average of 60% of unspecified bits, outperforming existing methods that consider this problem.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems, DFT 2007 |
| Pages | 439-447 |
| Number of pages | 9 |
| DOIs | |
| Publication status | Published - 2007 |
| Event | 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems, DFT 2007 - Rome, Italy Duration: 26 Sept 2007 → 28 Sept 2007 |
Other
| Other | 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems, DFT 2007 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 26/09/07 → 28/09/07 |