High Speed Comparator for the Moduli {2^<i>n</i>, 2^<i>n</i>-1, 2^<i>n</i>+1}

Abstract

f2 n ; 2 n À 1; 2 n þ 1g is one of the most commonly used moduli in residue number systems. In this express, we propose a novel comparator for the moduli f2 n ; 2 n À 1; 2 n þ 1g. Based on the proposed architecture, we can design high speed comparator for the moduli f2 n ; 2 n À 1; 2 n þ 1g, which is the fastest among all known comparators for the moduli f2 n ; 2 n À 1; 2 n þ 1g. The performance of the proposed comparator is evaluated and compared with the earlier fast comparators for the moduli f2 n ; 2 n À 1; 2 n þ 1g, 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.