An algorithm for stuck-at fault coverage analysis of digital logic circuits is presented. Based on a recently developed stuck-at fault model, the algorithm determines the effectiveness of a given test input set. The algorithm is applicable for studying sequential logic circuits, as well as combinati
โฆ LIBER โฆ
An algorithm to generate complete test sets for stuck-at faults in combinational logic circuits
โ Scribed by Leonard J. Tung; David V. Kerns
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 581 KB
- Volume
- 325
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
โฆ Synopsis
A new algorithm to generate test sets for stuck-at faults in combinational logic circuits via fault simulation is presented. The algorithm is non-path-sensitizing, non-pathtracing and can be easily implemented on a computer. The stuck-at fault model in the algorithm is developed using the component connection model. The algorithm can be extended to sequential digital circuits. The software generates the complete set of test input vectors,for each single stuck-at fault.
๐ SIMILAR VOLUMES
An algorithm for stuck-at fault coverage
โ
Leonard J. Tung
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 726 KB