DocumentCode :
839025
Title :
Testability of parity checkers
Author :
Mourad, Samiha ; McCluskey, Edward J.
Author_Institution :
Center for Reliable Comput., Stanford Univ., CA, USA
Volume :
36
Issue :
2
fYear :
1989
fDate :
5/1/1989 12:00:00 AM
Firstpage :
254
Lastpage :
262
Abstract :
Checkers are used in digital circuits to detect both intermittent and stuck-at faults. The most common error detectors are parity checkers. Such circuits are themselves subject to failures. The use of parity trees is outlined, and techniques for testing them are surveyed. The effect of the checker´s structure on its testability is discussed. Several fault models are considered: single stuck-at, multiple stuck-at, and bridging faults. The effectiveness of single stuck-at fault test sets in detecting multiple stuck-at and bridging faults is described. Upper bounds for the double fault coverage of the minimal single fault test are given for different tree structures. The testabilities of some selected checkers are examined to illustrate the concepts developed. A built-in self-test is proposed.<>
Keywords :
digital circuits; failure analysis; logic testing; bridging faults; built-in self-test; digital circuits; error detectors; intermittent faults; parity checkers; parity trees; stuck-at faults; testability; Automatic testing; Circuit faults; Circuit testing; Computer errors; Detectors; Digital circuits; Electrical fault detection; Fault detection; Tree data structures; Upper bound;
fLanguage :
English
Journal_Title :
Industrial Electronics, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0046
Type :
jour
DOI :
10.1109/41.19077
Filename :
19077
Link To Document :
بازگشت