On self-correcting logic circuits of unreliable gates with at most two inputs

DOI10.1134/S0001434622010187zbMath1490.94085OpenAlexW4213441732MaRDI QIDQ2113411

Kirill A. Popkov

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010187

zbMATH Keywords

Boolean functiongate circuitself-correctingunreliable gate

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the length of diagnostic tests for Boolean circuits
• Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1 at gate outputs
• Ternary paving matroids
• On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
• Self-correcting schemes for functions of polynomial weight
• On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
• A method of synthesis of irredundant circuits admitting single fault detection tests of constant length
• Complete diagnostic length 2 tests for logic networks under inverse faults of logic gates
• Short single tests for circuits with arbitrary stuck-at faults at outputs of gates
• Complexity of self-correcting circuits for some sequence of Boolean functions
• ON LOGIC NETWORKS ALLOWING SHORT SINGLE FAULT DETECTION TESTS UNDER ARBITRARY FAULTS OF GATES
• SINGLE FAULT DETECTION TESTS FOR LOGIC NETWORKS OF AND, NOT GATES
• A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS

This page was built for publication: On self-correcting logic circuits of unreliable gates with at most two inputs