Novel RNS structures for the moduli set (2 n −1, 2 n , 2 n +1)

Abstract In this paper, new architectures for fast and efficient conversions from the weighted binary numbers to their 3-moduli (2 n − 1, 2 n , 2 n + 1) residue number representation and vice versa is described. The converters are realised using carry save arithmetic and a novel modulo adder. The new adder is based on generating the carry-out bit first and feeding it forward as carry-in to perform modulo reduction. Since the choice of the adder is critical, the CLA adder which has the best performance when compared with other adders is used. An RNS multiplier for the same moduli set using the carry save scheme and the modulo adder is also described. Also, in this paper an RNS FIR filter based on the carry save arithmetic and the new modulo multiplier is presented. Comparison with existing designs has shown that the new designs based on the new modulo adder and the carry save arithmetic are much faster and have much less hardware than the existing structures.