Review of the book «Proceedings on the Self-Checking Embedded Control Circuits Synthesis Theory Based on Binary Redundant Codes»

Proceedings on the Self-Checking Embedded Control Circuits Synthesis Theory Based on Binary Redundant Codes. Vol. 1. Moscow, Nauka publ., 2020, 611 p. ISBN 978-5-02-040758-9.Proceedings on the Self-Checking Embedded Control Circuits Synthesis Theory Based on Binary Redundant Codes. Vol. 2. Moscow, Nauka publ., 2021, 527 p. ISBN 978-5-02-040757-2.The first volume of the book includes papers devoted to three main areas of research in the field of synthesis of self-checking discrete systems: study of features of classical sum codes (Berger codes), modular sum codes, as well as their modifications proposed by the authors of the articles; study of features of codes for which check bits are obtained using convolutions modulo М = 2 of a part of data bits (polynomial codes and classical Hamming codes); research of the Boolean Complement method for organisation of self-checking discrete systems based on redundant binary codes. Materials are provided on detailed characteristics of error detection in data bits of redundant binary codes under the condition of errorfree check bits, descriptions of methods for constructing previously unknown modified sum codes and features of methods for synthesizing self-checking discrete systems based on binary redundant codes.The second volume of the book includes papers in the field of constructing binary sum codes weighted bits and transitions between bits occupying adjacent positions in data vectors of code words, as well as the results of studying their characteristics and methods of synthesising coding equipment. The issues of application of features of codes in organisation of self-checking discrete systems are considered. The reader will find on the pages of this volume materials on detailed characteristics of error detection in data bits of weight-based sum codes provided that the check bits are error-free, descriptions of methods for constructing previously unknown weight-based sum codes and features of methods for synthesising self-checking discrete systems based on them.The book can be useful for developers, researchers and engineers working in the field of technical diagnostics of discrete systems and synthesis of systems with fault detection, as well as students studying computer science, computer technology and automation.

SYNTHESIS OF FULLY SELF-CHECKED SCHEMES BUILT-IN CONTROL BASED ON POLYNOMIAL CODES FOR COMBINATION LOGIC DEVICES

The article examines the methods of production of functional control systems for logic combinational circuits with full detection of any single faults using the error detection properties of polynomial codes. A classification of special generators of polynomials that form codes with a small value of the control vector length and complete identification of errors of a certain type or multiplicity is presented. A method is presented for constructing a functional control system with complete identification of single faults based on the complete detection of triple errors by polynomial codes. Algorithms for the search and formation of controllable H1-, H2- and H3-groups of circuit outputs, taking into account the properties of polynomial codes, have been developed. The types of functional dependence of the operating outputs for combinational circuits are listed, in which errors of various types can occur. Based on the detection of any symmetric and asymmetric errors by polynomial codes, a method is presented for the constructionof functional control systems with full identification of these type of errors. For an approximate scheme, the development of a functional control system based on the proposed methods is given as:-