Синтез самопроверяемых цифровых устройств на основе взвешенных кодов с суммированием, проверочные символы которых описываются самодвойственными булевыми функциями

Abstract

The proposed article considers sum code in a residue ring over a given modulo M of the data vector weighted bits. Test symbols are described by self-dual Boolean functions. It is proven that such codes can be constructed only under the condition M  {2, 4, 8, …} for certain arrays of weighting coefficients. The division into special classes of the weight-based sum code special case in the residue ring modulo M=4 is given. Cases with the number of data bits m=4 are considered. It has been determined that only two options for weighing with weight coefficients from arrays [1, 1, 2, 3] and [1, 2, 2, 2], without considering permutations of weights, give codes with the function selfduality property that describe check symbols. The concurrent error-detection circuit structure based on weight-based sum code in a residue ring by modulo M=4 with the m=4 data bits is given.