Cargando…
Features of digital signal processing algorithms using Galois fields GF(2(n)+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...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10599577/ https://www.ncbi.nlm.nih.gov/pubmed/37878646 http://dx.doi.org/10.1371/journal.pone.0293294 |