Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates
- Autores: Popkov K.1
-
Afiliações:
- Keldysh Institute of Applied Mathematics
- Edição: Volume 12, Nº 2 (2018)
- Páginas: 302-312
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213052
- DOI: https://doi.org/10.1134/S1990478918020102
- ID: 213052
Citar
Resumo
We consider the problem of the synthesis of the logic networks implementing Boolean functions of n variables and allowing short complete fault detection tests regarding arbitrary stuck-at faults at the outputs of gates. We prove that there exists a basis consisting of two Boolean functions of at most four variables in which we can implement each Boolean function by a network allowing such a test with length at most 2.
Palavras-chave
Sobre autores
K. Popkov
Keldysh Institute of Applied Mathematics
Autor responsável pela correspondência
Email: kirill-formulist@mail.ru
Rússia, Miusskaya pl. 4, Moscow, 125047