This paper presents a new fast RNS converter for the 3 moduli set of the fo
rm {2(n) - 1,2(n),2(n) + 1}. A new property of the CRT is also presented an
d this property is used to develop a fast converter for this 3 moduli set.
The resulting implementation is based on carry-save adders and one carry-pr
opagate adder stage, without the need for any look-up tables. The new desig
n is faster and smaller than existing designs.