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

Derivation of minimum length fault tests for combinational circuits

โœ Scribed by Suresh Rai; K.K. Aggarwal


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
158 KB
Volume
19
Category
Article
ISSN
0026-2714

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm for stuck-at fault coverage
โœ Leonard J. Tung ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 726 KB

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

Static test compaction for IDDQ testing
โœ Yoshinobu Higami; Kewal K. Saluja; Yuzo Takamatsu; Kozo Kinoshita ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 335 KB ๐Ÿ‘ 2 views

This paper presents a static test compaction method for IDDQ testing of sequential circuits. Test compaction reduces test application time and tester memory and consequently reduces testing cost. Particularly for IDDQ testing, measurement of IDDQ is time-consuming, and thus test compaction is a very