It is shown that algebraic fields and rings can become a very promising tool for digital signal processing. This is mainly due to the fact that any digital signals change in a finite range of amplitudes and, therefore, there are only a finite set of levels that can correspond to the amplitudes of a signal reduced to a discrete form. This allows you to establish a one-to-one correspondence between the set of levels and such algebraic structures as fields, rings, etc. This means that a function that takes values in any of the algebraic structures containing a finite set of elements can serve as a model of a signal reduced to a discrete form. A special case of such a signal model are functions that take values in Galois fields. It is shown that, along with Galois fields, in certain cases, algebraic rings contain zero divisors can be used to construct signal models. This representation is convenient because in this case it becomes possible to independently operate with the digits of the number that enumerates the signal levels. A simple and intuitive method for constructing rings is proposed, based on an analogy with the method of algebraic extensions.
A method is proposed that reduces the computation of the reduced digital convolution operation to a set of independent convolutions computed in Galois fields. The reduced digital convolution is understood as a modified convolution operation whose result is a function taking discrete values in the same discrete scale as the original functions. The method is based on the use of partial convolutions, reduced to computing a modulo integer , which is the product of several prime numbers: . It is shown that it is appropriate to use the expansion of the number , to , where is an additional prime number, to compute the reduced digital convolution. This corresponds to the use of additional digits in the number system used to convert to partial convolutions. The inverse procedure, i.e., reducing the result of calculations modulo q to the result corresponding to calculations modulo , is provided by the formula that used only integers proved in this paper. The possibilities of practical application of the obtained results are discussed.
4 September 2023 in International Journal of Information Technology
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. It is shown that for such numbers a simple algorithm for digital logarithm calculations may be proposed. This algorithm allows, among other things, to reduce the multiplication operation modulo a prime number p = 2n+1 to an addition operation.
It is shown that it is reasonable to use Galois fields, including those obtained by algebraic extensions, to describe the position of a point in a discrete Cartesian coordinate system in many cases. This approach is applicable to any problem in which the number of elements (e.g., pixels) into which the considered fragment of the plane is dissected is finite. In particular, it is obviously applicable to the processing of the vast majority of digital images actually encountered in practice. The representation of coordinates using Galois fields of the form GF(p2) is a discrete analog of the representation of coordinates in the plane through a complex variable. It is shown that two different types of algebraic extensions can be used simultaneously to represent transformations of discrete Cartesian coordinates described through Galois fields. One corresponds to the classical scheme, which uses irreducible algebraic equations. The second type proposed in this report involves the use of a formal additional solution of some equation, which has a usual solution. The correctness of this approach is justified through the representation of the elements obtained by the algebraic expansion of the second type by matrices defined over the basic Galois field. It is shown that the proposed approach is the basis for the development of new methods of information protection, designed to control groups of UAVs in the zone of direct radio visibility. The algebraic basis of such methods is the solution of systems of equations written in terms of finite algebraic structures.