Open AccessTwo-Module Weight-Based Sum Code in Residue Ring Modulo M=4
Author(s) -
Д.В. Ефанов,
Vladimir Sapozhnikov,
Vladimir Sapozhnikov
Publication year - 2020
Publication title -
trudy spiiran
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 9
eISSN - 2078-9599
pISSN - 2078-9181
DOI - 10.15622/sp.2020.19.3.8
Subject(s) - modulo , weighting , code (set theory) , mathematics , extension (predicate logic) , gauss sum , discrete mathematics , ring (chemistry) , weight distribution , algorithm , computer science , arithmetic , medicine , set (abstract data type) , radiology , programming language , chemistry , organic chemistry , engineering , aerospace engineering
The paper describes research results of features of error detection in data vectors by sum codes. The task is relevant in this setting, first of all, for the use of sum codes in the implementation of the checkable discrete systems and the technical means for the diagnosis of their components. Methods for sum codes constructing are described. A brief overview in the field of methods for sum codes constructing is provided. The article highlights codes for which the values of all data bits are taken into account once by the operations of summing their values or the values of the weight coefficients of the bits during the formation of the check vector. The paper also highlights codes that are formed when the data vectors are initially divided into subsets, in particular, into two subsets. An extension of the sum code class obtained by isolating two independent parts in the data vectors, as well as weighting the bits of the data vectors at the stage of code construction, is proposed.
The paper provides a generalized algorithm for two-module weighted codes construction, and describes their features obtained by weighing with non-ones weight coefficients for one of data bits in each of the subvectors, according to which the total weight is calculated. Particular attention is paid to the two-module weight-based sum code, for which the total weight of the data vector in the residue ring modulo M = 4 is determined. It is shown that the purpose of the inequality between the bits of the data vector in some cases gives improvements in the error detection characteristics compared to the well-known two-module codes. Some modifications of the proposed two-module weighted codes are described. A method for calculating the total number of undetectable errors in the two-module sum codes in the residue ring modulo M = 4 with one weighted bit in each of the subsets is proposed. Detailed characteristics of error detection by the considered codes both by the multiplicities of undetectable errors and by their types (unidirectional, symmetrical and asymmetrical errors) are given. The proposed codes are compared with known codes. A method for the synthesis of two-module sum encoders on a standard element base of the single signals adders is proposed. The classification of two-module sum codes is presented.