Optimal Small-Bitwidth Moduli Set for Residue Number Systems
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910072472338432 |
|---|---|
| author | Gorodecky, Danila |
| author_facet | Gorodecky, Danila |
| contents | This technical note presents a algorithmic approach for generating optimal sets of co-prime moduli within specified integer ranges. The proposed method addresses the challenge of balancing moduli bit-lengths while maximizing the dynamic range in Residue Number System (RNS) implementations. Experimental results demonstrate that the generated moduli sets achieve optimal dynamic range coverage while maintaining balanced bit-length distribution, making them particularly suitable for parallel hardware implementations based on RNS. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_24387 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Optimal Small-Bitwidth Moduli Set for Residue Number Systems Gorodecky, Danila Other Computer Science This technical note presents a algorithmic approach for generating optimal sets of co-prime moduli within specified integer ranges. The proposed method addresses the challenge of balancing moduli bit-lengths while maximizing the dynamic range in Residue Number System (RNS) implementations. Experimental results demonstrate that the generated moduli sets achieve optimal dynamic range coverage while maintaining balanced bit-length distribution, making them particularly suitable for parallel hardware implementations based on RNS. |
| title | Optimal Small-Bitwidth Moduli Set for Residue Number Systems |
| topic | Other Computer Science |
| url | https://arxiv.org/abs/2603.24387 |