Simple coding scheme for modular arithmetic
B. S. Adiga, Priti Shankar · Electronics Letters · 1983
A dual representation scheme for performing arithmetic modulo an arbitrary integer M is presented. The coding scheme maps each integer N in the range 0 ≤ N < M into one of two representations, each being identified by its most significant bit. The encoding of numbers is straightforward and the problem of checking for unused combinations is eliminated.