Computing multiple modulo summation (abstract only)
Chang N. Zhang, Behrooz Shirazi, David Y. Y. Yun · 1987
This paper introduces a new algorithm for an efficient computation of @@@@tj mod M, which is the fundamental operation in residue arithmetic. In addition, two hardware designs for efficient implementation of the algorithm and an application to Chinese Remainder Theorem (CRT) are developed. The proposed algorithm is fast and simple since it eliminates modulo arithmetic and the requirement of “whole word comparisons” in the operations. Instead, we take advantage of conventional binary carry save adders, simple bit checking, and dropping the overflow bits to efficiently implement the algorithm.