๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for stuck-at fault coverage analysis of combinational and sequential logic circuits

โœ Scribed by Leonard J. Tung


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
726 KB
Volume
326
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 combinational logic circuits. The software developed forfault coverage analysis of all single stuck-at faults is simple and fast.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm to generate complete test s
โœ Leonard J. Tung; David V. Kerns ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 581 KB

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