Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2604.04796 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913007836069888 |
|---|---|
| author | Olsen, Eric B. |
| author_facet | Olsen, Eric B. |
| contents | Residue Number Systems (RNS) offer efficient modular arithmetic and natural parallelism, but direct integer division in RNS remains a difficult and comparatively underdeveloped operation. This paper builds on the type-II division algorithm of Szabo and Tanaka and reformulates it for more efficient hardware implementation. A principal contribution is the introduction of a power-based RNS, in which moduli are selected as powers of natural primes, increasing dynamic range, improving bit efficiency, and providing greater flexibility for scaling during division. The paper further formalizes three decomposition methods required by the division process: multi-factor scaling for modulus-based division, mixed-radix conversion for base extension and comparison, and a new divisor decomposition method introduced in this work. Each method is supported by mathematical development, including analysis of modulus invalidation during computation. These results simplify the hardware structure of the algorithm and improve its scalability. Supported by hardware diagrams and performance tables, the work advances both the theory and practical implementation of direct RNS division. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_04796 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Direct Integer Division in RNS and its Hardware Solutions Olsen, Eric B. Hardware Architecture Residue Number Systems (RNS) offer efficient modular arithmetic and natural parallelism, but direct integer division in RNS remains a difficult and comparatively underdeveloped operation. This paper builds on the type-II division algorithm of Szabo and Tanaka and reformulates it for more efficient hardware implementation. A principal contribution is the introduction of a power-based RNS, in which moduli are selected as powers of natural primes, increasing dynamic range, improving bit efficiency, and providing greater flexibility for scaling during division. The paper further formalizes three decomposition methods required by the division process: multi-factor scaling for modulus-based division, mixed-radix conversion for base extension and comparison, and a new divisor decomposition method introduced in this work. Each method is supported by mathematical development, including analysis of modulus invalidation during computation. These results simplify the hardware structure of the algorithm and improve its scalability. Supported by hardware diagrams and performance tables, the work advances both the theory and practical implementation of direct RNS division. |
| title | Direct Integer Division in RNS and its Hardware Solutions |
| topic | Hardware Architecture |
| url | https://arxiv.org/abs/2604.04796 |