Reed-Muller Realization of X (mod P)
This addresses a computational bottleneck in modular arithmetic, though it appears incremental as it builds on existing realizations.
The paper tackles the problem of realizing X (mod P) for arbitrary P using a Reed-Muller polynomial expansion, demonstrating competitive speed processing compared to known approaches, with specific results shown for P=7.
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.