Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2010, Volume 22, Issue 3, Pages 127–133
DOI: https://doi.org/10.4213/dm1112 (Mi dm1112) 		 
This article is cited in 29 scientific papers (total in 29 papers)

Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements

Yu. V. Borodina, P. A. Borodin
Full-text PDF (112 kB) Citations (29)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1112
Abstract: Methods of synthesis of easily testable circuits of functional elements over the Zhegalkin basis for arbitrary Boolean functions are suggested. It is assumed that the faults are constant faults of type 0 at outputs of elements. It is proved that any Boolean function can be realised by a circuit allowing a complete test of length 1.
Received: 23.01.2009
English version:
Discrete Mathematics and Applications, 2010, Volume 20, Issue 4, Pages 441–449
DOI: https://doi.org/10.1515/DMA.2010.027
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: Yu. V. Borodina, P. A. Borodin, “Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements”, Diskr. Mat., 22:3 (2010), 127–133; Discrete Math. Appl., 20:4 (2010), 441–449
Citation in format AMSBIB
\Bibitem{BorBor10}
\by Yu.~V.~Borodina, P.~A.~Borodin
\paper Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type~0 at outputs of elements
\jour Diskr. Mat.
\yr 2010
\vol 22
\issue 3
\pages 127--133
\mathnet{http://mi.mathnet.ru/dm1112}
\crossref{https://doi.org/10.4213/dm1112}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2757890}
\elib{https://elibrary.ru/item.asp?id=20730352}
\transl
\jour Discrete Math. Appl.
\yr 2010
\vol 20
\issue 4
\pages 441--449
\crossref{https://doi.org/10.1515/DMA.2010.027}
\elib{https://elibrary.ru/item.asp?id=22104080}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77958504158}
Linking options:
  • https://www.mathnet.ru/eng/dm1112
  • https://doi.org/10.4213/dm1112
  • https://www.mathnet.ru/eng/dm/v22/i3/p127
    • This publication is cited in the following 29 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:853
    Full-text PDF :313
    References:67
    First page:25
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024