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

Suleimenov, Ibragim E.; Vitulyova, Yelizaveta S.; Matrassulova, Dinara K.

doi:10.1371/journal.pone.0293294

The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.

PLoS ONE

2023

DOI: 10.1371/journal.pone.0293294

|View full text |Cite

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

Ibragim E. Suleimenov,

Yelizaveta S. Vitulyova,

Dinara K. Matrassulova

Abstract: 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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

The specifics of the Galois field GF(257) and its use for digital signal processing

Bakirov,

Matrassulova,

Vitulyova

et al. 2024

Sci Rep

View full text Add to dashboard Cite

An algorithm of digital logarithm calculation for the Galois field $$GF(257)$$ G F ( 257 ) is proposed. It is shown that this field is coupled with one of the most important existing standards that uses a digital representation of the signal through 256 levels. It is shown that for this case it is advisable to use the specifics of quasi-Mersenne prime numbers, representable in the form $${p=2}^{n}+1$$ p = 2 n + 1 , which includes the number 257. For fields $$GF({2}^{n}+1)$$ G F ( 2 n + 1 ) , an alternating encoding can be used, in which non-zero elements of the field are displayed through binary characters corresponding to the numbers + 1 and − 1. In such an encoding, multiplying a field element by 2 is reduced to a quasi-cyclic permutation of binary symbols (the permuted symbol changes sign). Proposed approach makes it possible to significantly simplify the design of computing devices for calculation of digital logarithm and multiplication of numbers modulo 257. A concrete scheme of a device for digital logarithm calculation in this field is presented. It is also shown that this circuit can be equipped with a universal adder modulo an arbitrary number, which makes it possible to implement any operations in the field under consideration. It is shown that proposed digital algorithm can also be used to reduce 256-valued logic operations to algebraic form. It is shown that the proposed approach is of significant interest for the development of UAV on-board computers operating as part of a group.

show abstract

The specifics of the Galois field GF(257) and its use for digital signal processing

Bakirov,

Matrassulova,

Vitulyova

et al. 2024

Sci Rep

View full text Add to dashboard Cite

show abstract

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

Suleimenov,

Kadyrzhan,

Matrassulova

et al. 2024

Applied Sciences

View full text Add to dashboard Cite

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.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

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

Cited by 2 publications

References 23 publications

The specifics of the Galois field GF(257) and its use for digital signal processing

The specifics of the Galois field GF(257) and its use for digital signal processing

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

Contact Info

Product

Resources

About