Back to Search
Start Over
Features of digital signal processing algorithms using Galois fields GF(2n+1).
- Source :
-
PLoS ONE . 10/25/2023, Vol. 18 Issue 10, p1-12. 12p. - Publication Year :
- 2023
-
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 algorithm allows, among other things, to reduce the multiplication operation modulo a prime number p = 2n+1 to an addition operation. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19326203
- Volume :
- 18
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- PLoS ONE
- Publication Type :
- Academic Journal
- Accession number :
- 173178356
- Full Text :
- https://doi.org/10.1371/journal.pone.0293294