Optimal Small-Bitwidth Moduli Set for Residue Number Systems
This work addresses a specific challenge in hardware implementations of Residue Number Systems, but it appears incremental as it focuses on algorithmic optimization within an existing framework.
The paper tackled the problem of generating optimal sets of co-prime moduli in Residue Number Systems to balance bit-lengths and maximize dynamic range, achieving optimal dynamic range coverage with balanced bit-length distribution as demonstrated experimentally.
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.