Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2018, Volume 25, Issue 2, Pages 62–81 (Mi da896)  

This article is cited in 1 scientific paper (total in 1 paper)

Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates

K. A. Popkov

Keldysh Institute of Applied Mathematics, 4 Miusskaya Sq., 125047 Moscow, Russia

Abstract: 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. Illustr. 1, bibliogr. 33.

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

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


DOI: https://doi.org/10.17377/daio.2018.25.592

Full text: PDF file (434 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2018, 12:2, 302–312

UDC: 519.718.7
Received: 06.10.2017

Citation: K. A. Popkov, “Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates”, Diskretn. Anal. Issled. Oper., 25:2 (2018), 62–81; J. Appl. Industr. Math., 12:2 (2018), 302–312

Citation in format AMSBIB
\Bibitem{Pop18}
\by K.~A.~Popkov
\paper Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates
\jour Diskretn. Anal. Issled. Oper.
\yr 2018
\vol 25
\issue 2
\pages 62--81
\mathnet{http://mi.mathnet.ru/da896}
\crossref{https://doi.org/10.17377/daio.2018.25.592}
\elib{https://elibrary.ru/item.asp?id=34875796}
\transl
\jour J. Appl. Industr. Math.
\yr 2018
\vol 12
\issue 2
\pages 302--312
\crossref{https://doi.org/10.1134/S1990478918020102}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85047795814}


Linking options:
  • http://mi.mathnet.ru/eng/da896
  • http://mi.mathnet.ru/eng/da/v25/i2/p62

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. K. A. Popkov, “Short complete fault detection tests for logic networks with fan-in two”, J. Appl. Industr. Math., 13:1 (2019), 118–131  mathnet  crossref  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:124
    Full text:19
    References:16
    First page:1

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021