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 = 2 n +1. For such numbers, it is possible to implement...
Saved in:
| Published in: | PloS one Vol. 18; no. 10; p. e0293294 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
San Francisco, CA USA
Public Library of Science
25.10.2023
Public Library of Science (PLoS) |
| Subjects: | |
| ISSN: | 1932-6203, 1932-6203 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!