Improving the efficiency of using multivalued logic tools: application of algebraic rings.

It is shown that in order to increase the efficiency of using methods of abstract algebra in modern information technologies, it is important to establish an explicit connection between operations corresponding to various varieties of multivalued logics and algebraic operations. For multivalued logics, the number of variables in which is equal to a prime number, such a connection is naturally established through explicit algebraic expressions in Galois fields. It is possible to define an algebraic δ-function, which allows you to reduce any truth table to an algebraic expression, for the case when the number of values accepted by a multivalued logic variable is equal to an integer power of a prime number.

Features of digital signal processing algorithms using Galois fields GF(2n+1).

An alternating representation of integers in binary form is proposed, in which the numbers -1 and +1 are used instead of zeros and ones. It is shown that such a representation creates considerable convenience for multiplication numbers modulo p = 2n+1. For such numbers, it is possible to implement a multiplication algorithm modulo p, similar to the multiplication algorithm modulo the Mersenne number.

Improving the efficiency of using multivalued logic tools.

Multivalued logics are becoming one of the most important tools of information technology. They are in great demand for creation of artificial intelligence systems that are close to human intelligence, since the functioning of the latter cannot be reduced to the operations of binary logic. At the same time, the problem of improving the efficiency of using the results of research in multivalued logics, as well as the problem of interpreting variables of multivalued logic, is acute.