On modulus replication for residue arithmetic computations of complex inner products

A technique is presented for coding weighted magnitude components (e.g. bits) of numbers directly into polynomial residue rings, such that repeated use may be made of the same set of moduli to effectively increase the dynamic range of the computation. This effectively limits the requirement for large sets of relatively prime moduli, For practical computations over quadratic residue rings, at least 6-bit moduli have to be considered. It is shown that 5-bit moduli can be effectively used for large dynamic range computations