|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2012, Number 2, Pages 24–29
(Mi vmumm475)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Mathematics
A method for synthesis of easily-testable circuits in some basis admitting single fault detection tests of constant length
D. S. Romanov Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
It is constructively proved that any Boolean function of $n$ variables may be implemented in the basis of gates $\{ x\& y, x\oplus y, 1, {\bar x}(y\vee z)\vee x(y\sim z)\}$ by a testable combinational circuit admitting a fault detection test set whose power does not exceed 4 under arbitrary single inverse or constant (stuck-at) faults at outputs of gates.
Key words:
combinational circuit, fault detection test set, constant (stuck-at) fault at output of gate, inverse fault at output of gate, Shannon function, easy-testable circuit.
Received: 11.02.2011 Revised: 07.09.2011
Citation:
D. S. Romanov, “A method for synthesis of easily-testable circuits in some basis admitting single fault detection tests of constant length”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2012, no. 2, 24–29; Moscow University Mathematics Bulletin, 67:2 (2012), 69–73
Linking options:
https://www.mathnet.ru/eng/vmumm475 https://www.mathnet.ru/eng/vmumm/y2012/i2/p24
|
Statistics & downloads: |
Abstract page: | 184 | Full-text PDF : | 44 | References: | 39 |
|