Article collection "Mathematical Problems of Cybernetics" №5, Moscow, 1994

Authors:Turdaliev N.I.

On self-correction of logic networks for some Boolean functions

Abstract:

We propose a method of synthesis of nontrivial self-correcting logic networks regarding a faults in an arbitrary finite complete basis for Boolean operators (including Boolean functions), which can be implemented by networks having a block structure in the same basis. We obtain the upper bound of the complexity of implementation of such operators in this class of self-correcting networks. In particular, we find a nontrivial upper bound on the complexity of implementation of the comparison function of two binary n-tuples in the class of 1-self-correcting networks in the standard basis {&,V,¬}.