This paper presents a new RNS converter using any number of relatively prime moduli of the form 2/sup n/ and 2/sup n/ /spl plusmn/ 1. With the exception of common 3 moduli sets such as {2/sup n/ - 1,2/sup n/, 2/sup n/ + 1}, FINS output converters based on the CRT require the computation of a sum of products modulo a large number. The new converter presented in this paper uses the fractional representation for the output and eliminates the requirement for multiplications, thereby reducing area and delay. Further area improvements are possible by exploiting the period of terms to be added. An algorithmic approach is used to obtain full adder-based architectures that are optimized for area and delay.

This paper presents a new fast RNS converter for the 3 moduli set of the form {2/sup n/-1,2/sup n/,2/sup n/+1}. A new property of the Chinese remainder theorem (CRT) is also presented and 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-propagate adder stage, without the need for any look-up tables. The new design is faster and smaller than existing designs.