RUS  ENG
Full version
JOURNALS // Proceedings of the Institute for System Programming of the RAS // Archive

Proceedings of ISP RAS, 2017 Volume 29, Issue 5, Pages 39–60 (Mi tisp257)

This article is cited in 3 papers

Modified codes with weighted-transitions summation in concurrent error detection systems of combinational circuits

V. V. Sapozhnikov, Vl. V. Sapozhnikov, D. V. Efanov

Emperor Alexandex I St. Petersburg state transport university

Abstract: A method for constructing modified codes with summation of weighted transitions between bits in data vectors occupying neighboring positions is proposed. New codes with summation have the same number of check bits as the classic Berger codes, but they detect more errors in data vectors. Modified codes with summation of weighted transitions in comparison with Berger codes also have improved error detection characteristics in the area of small multiplicity. In addition, for some values of the lengths of information vectors codes can be constructed with the detection of any twofold and any triple errors. The authors developed a method for synthesizing concurrent error detection systems of combinational circuits, based on the analysis of the topology of the object of diagnosis with the selection of groups of checkable outputs, taking into account the properties of error detection by modified codes with summation of weighted transitions. An algorithm for the synthesis of a concurrent error detection systems has been developed.

Keywords: concurrent error-detection system, combinational circuit, Berger code, weight-transition sum code, double errors detection, triple errors detection.

DOI: 10.15514/ISPRAS-2017-29(5)-3



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026