The self-diagnosis of multi-unit digital systems is reconsidered assuming the hypothesis that: (i) faults are not equally probable and (ii) the outcome of tests performed between units are not deterministic. Given a set of test results, the problem of finding the most likely set of faulty units of a system is considered here and an approach to probabilistic diagnosability with repair is presented. it is shown that a significant class of systems exists for which these problems are easily solved and a decoding procedure is given whose complexitY is 0(n) where n is the number of system units.
Probabilistic syndrome decoding in self-diagnosable digital systems
1981
Abstract
The self-diagnosis of multi-unit digital systems is reconsidered assuming the hypothesis that: (i) faults are not equally probable and (ii) the outcome of tests performed between units are not deterministic. Given a set of test results, the problem of finding the most likely set of faulty units of a system is considered here and an approach to probabilistic diagnosability with repair is presented. it is shown that a significant class of systems exists for which these problems are easily solved and a decoding procedure is given whose complexitY is 0(n) where n is the number of system units.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_421542-doc_149670.pdf
solo utenti autorizzati
Descrizione: Probabilistic syndrome decoding in self-diagnosable digital systems
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.22 MB
Formato
Adobe PDF
|
1.22 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
