✦ LIBER ✦

Logical redundancies in irredundant combinational circuits

✍ Scribed by Susanta Chakraborty; Debesh K. Das; Bhargab B. Bhattacharya

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 428 KB
Volume: 4
Category: Article
ISSN: 0923-8174
DOI: 10.1007/bf00971641

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Checkpoints in irredundant two-level com

Checkpoints in irredundant two-level combinational circuits

✍ Jwu E. Chen; Chung Len Lee; Wen Zen Shen 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 165 KB

It is shown that for a two-level irredundant single/multiple output combinational circuit, the checkpoints consist of all primary inputs without fanout, and all fanout branches in the circuit. Any test set that detects all single stuck faults on these checkpoints will also detect all single stuck fa

Hazards in combinational circuits

✍ M. Krieger; Y. Zisapel; J. Kella 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Identification of redundant faults in co

Identification of redundant faults in combinational circuits

✍ Tetsuro Minamiyama; Yuzo Takamatsu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 2 views

An efficient redundant-fault identification method is useful for test pattern generation. The authors earlier proposed a method for redundant fault identification of combinational circuits that consisted of the procedures regarding the fan-out stems used in the FIRE algorithm and the analysis of ta

Algorithm for generating tests for detec

Algorithm for generating tests for detecting faults of type ∼ of logical elements in combinational circuits

✍ V. V. Brovarnik; V. A. Pepelyaev 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 414 KB

Hazards in asynchronous logical circuits

✍ A. N. Chebotarev 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 390 KB

Bounding fault detection probabilities i

Bounding fault detection probabilities in combinational circuits

✍ George Markowsky 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 603 KB

This paper focuses on the problem of bounding fault detection probabilities in combinational circuits. Two algorithms, the complete cutting algorithm and the gate blocking algorithm, are presented that always produce true lower bounds on the detection probability of a fault. Both algorithms can be u