High Speed Comparator for the Moduli {2ⁿ, 2ⁿ-1, 2ⁿ+1}

Abstract

{2ⁿ, 2ⁿ-1, 2ⁿ+1} is one of the most commonly used moduli in residue number systems. In this express, we propose a novel comparator for the moduli {2ⁿ, 2ⁿ-1, 2ⁿ+1}. Based on the proposed architecture, we can design high speed comparator for the moduli {2ⁿ, 2ⁿ-1, 2ⁿ+1}, which is the fastest among all known comparators for the moduli {2ⁿ, 2ⁿ-1, 2ⁿ+1}. The performance of the proposed comparator is evaluated and compared with the earlier fast comparators for the moduli {2ⁿ, 2ⁿ-1, 2ⁿ+1}, based on a simple gate-count and gate-delay model. The proposed comparator can improve the state-of-art by 8% on the average in terms of area and 6% on the average in terms of performance delay.