Danila Gorodecky

Danila Gorodecky

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.

Danila Gorodecky

This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The advantage of the approach concludes in the capability to realize X (mod P) for an arbitrary P. The approach is competitive with the known realizations on the speed processing. Advantages and results of comparison with the known approaches for X [9:1] and P=7 is demonstrated.