RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Keldysh Institute preprints: Year: Volume: Issue: Page: Find

 Keldysh Institute preprints, 2018, 197, 24 pages (Mi ipmp2556)

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

K. A. Popkov

Abstract: It is established that one can implement almost any 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 not exceeding $4$ under arbitrary stuck-at faults at outputs of gates. The following assertions are also proved: one can implement any 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 not more than one dummy variable and allowing a complete fault detection test with length not exceeding $5$ (not exceeding $4$, respectively) under faults of the same type.

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

 Funding Agency Grant Number Russian Science Foundation 14-21-00025 Ï

DOI: https://doi.org/10.20948/prepr-2018-197

Full text: PDF file (431 kB)
Full text: http:/.../preprint.asp?id=2018-197&lg=r
References: PDF file   HTML file

Document Type: Preprint

Citation: K. A. Popkov, “Short complete fault detection tests for logic networks with fan-in two”, Keldysh Institute preprints, 2018, 197, 24 pp.

Citation in format AMSBIB
\Bibitem{Pop18} \by K.~A.~Popkov \paper Short complete fault detection tests for logic networks with fan-in two \jour Keldysh Institute preprints \yr 2018 \papernumber 197 \totalpages 24 \mathnet{http://mi.mathnet.ru/ipmp2556} \crossref{https://doi.org/10.20948/prepr-2018-197}