Peculiarities of Applying Partial Convolutions to the Computation of Reduced Numerical Convolutions

2024

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.3390/app14146388
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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 q0, which is the product of several prime numbers: q0=p1p2…pn. It is shown that it is appropriate to use the expansion of the number q0, to q=p0p1p2…pn, where p0 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 q0, is provided by the formula that used only integers proved in this paper. The possibilities of practical application of the obtained results are discussed.