Short complete fault detection tests for~logic~networks with fan-in two

K. A. Popkov

Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 1, pp. 89-113

Résumé

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.

Détail

Keywords: logic network, arbitrary stuck-at fault, complete fault detection test.