The Weight-Based Sum Codes in the Residue Ring by Arbitrary Modulus for Synthesis of Self-Checking Digital Computing Systems
Д.В. Ефанов, Artem V. Pashukov · 2021
The authors of the paper consider the features of the weight-based sum code in the residue ring by arbitrary modulus. For the first time, the error detection characteristics by this codes class and some patterns of using specific modules and weight coefficient values have been established. It is shown that the number of different weight-based codes is limited, but there are a large number of ways to construct them for each value of the bits number in data vectors. An algorithm for obtaining the bits of the check vectors of the considered codes is presented. Examples of their construction are given, and calculating the number of undetectable errors in data vectors is described. The code properties under study are determined, the account of which is useful in solving problems of technical diagnostics. An example of such a task is the synthesis of self-checking digital devices and devices with controllable architecture. The analysis results of the considered code detecting abilities for the built-in control circuits of combinational benchmarks are presented. The results obtained in this work are universal and are not focused on using only one element base of the implemented devices.