For example,Бобцов

TERNARY MODULAR CODES WITH SUMMATION FOR THE SYNTHESIS OF DIGITAL SELF-TESTING DEVICES

Annotation

Ternary summation codes with simple construction rules, suitable for the digital self-checking circuits synthesis operating in ternary logic and able of detecting any non-compositional errors in information vectors (when the number of characters of each type is preserved), are considered. Rules for constructing the ternary sum codes, similar in its properties to the Berger binary code, are given. Two modifications of the ternary sum code are described – sum codes in the residues modulo μ=3 and μ=9 ring. Several characteristics of error detection by the codes are described. It is shown that the proportion of errors of multiplicity d, undetectable by binary summation codes, of the total number of errors of the given multiplicity, is a constant value independent of the information vector length.

Keywords

Постоянный URL

Articles in current issue

CONTENT © ITMO UNIVERSITY 1993-2024