Short complete fault detection tests for~logic~networks with fan-in two
Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 1, pp. 89-113
Voir la notice de l'article provenant de la source Math-Net.Ru
It is established that we can implement almost every Boolean function on $n$ variables by a logic network in the basis $\{x\,\\, y,\, {x\vee y},$ ${x\oplus y}, \, 1\}$, allowing a complete fault detection test with length at most $4$ under arbitrary stuck-at faults at outputs of gates. The following assertions are also proved: We can implement each Boolean function on $n$ variables by a logic network in the basis $\{x\,\\,y,\, x\vee y,\, x\oplus y,\, 1\}$ (in the basis $\{x\,\\,y,\, x\vee y,\, x\vee\overline y,\, x\oplus y\}$) containing at most one dummy variable and allowing a complete fault detection test of length at most $5$ (at most $4$, respectively) under faults of the same type. Illustr. 2, bibliogr. 24.
Keywords:
logic network, arbitrary stuck-at fault, complete fault detection test.
@article{DA_2019_26_1_a5,
author = {K. A. Popkov},
title = {Short complete fault detection tests for~logic~networks with fan-in two},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {89--113},
publisher = {mathdoc},
volume = {26},
number = {1},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2019_26_1_a5/}
}
K. A. Popkov. Short complete fault detection tests for~logic~networks with fan-in two. Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 1, pp. 89-113. http://geodesic.mathdoc.fr/item/DA_2019_26_1_a5/