|
Minimal complete fault detection tests for logic networks in the standard basis
K. A. Popkov
Abstract:
For each Boolean function, we find the exact value of minimal possible length of a complete fault detection test for logic networks implementing this function in the basis “conjunction, disjunction, negation” under one-type stuck-at faults at outputs of gates.
Keywords:
logic network, one-type stuck-at fault, complete fault detection test.
Citation:
K. A. Popkov, “Minimal complete fault detection tests for logic networks in the standard basis”, Keldysh Institute preprints, 2018, 161, 7 pp.
Linking options:
https://www.mathnet.ru/eng/ipmp2520 https://www.mathnet.ru/eng/ipmp/y2018/p161
|
Statistics & downloads: |
Abstract page: | 107 | Full-text PDF : | 38 | References: | 23 |
|