Hardware implementation of Chinese remainder theorem using redundant binary representation
Kazuhiro Ariyama, H. Toyoshima · 2002
In this paper, a new method for hardware implementation of the Chinese Remainder Theorem (CRT). Taking a redundant binary representation, we can realize the CRT algorithm which needs only a one stage carry propagate adder (CPA), though the conventional methods use several stages of CPA. The proposed method can reduce the maximum delay of computing time in RNS-binary conversion.