Binary paradigm and systolic array implementation for residue arithmetic

The problem of residue, or modular, arithmetic is fundamental to symbolic and algebraic computation, coding theory and applications, as well as to error-free arithmetic computations. This paper describes novel algorithms that can lead to efficient hardware for arithmetic operations in residue domains. One of the main achievements is in allowing the flexibility of changing moduli. The technology of systolic array has been used to implement one of the most representative operations, the modular multipler. It is shown that a linear systolic array can compute N modular products in time O(N) with constant number of cells.