Mod m arithmetic in binary systems

Even if the most common approach to mod m arithmetic is based on look-up tables, the use of binary systems is valid in those situations, such as large-moduli residue arithmetic or conversion processes, where a memory approach is not viable. A general approach to the problem of performing mod m computations in binary systems is presented. The proposed solution proves useful in various applications, such as converting binary integers to residue notation and mod m addition or multiplication. Examples are given together with possible VLSI implementations. © 1991.