Efficient residue comparison algorithm for general moduli sets

In this paper, we propose new residue comparison algorithms for general moduli sets and present an efficient ROM-free residue comparator for {2ⁿ+1,2ⁿ,2ⁿ-1} using the smallest modulo operation without introducing redundant modulus. Compared to the residue comparator based on the fastest known residue-to-binary (R/B) converter, our design is faster and reduces the hardware close to half.