An Efficient RNS Saler for 2ⁿ-1,2ⁿ,2ⁿ+1

This paper presents an efficient Residue Number System (RNS) scaling algorithm and architecture for the balanced special moduli set2ⁿ-1,2ⁿ,2ⁿ+1.Based on Chinese Remainder Theorem (CRT),the scaling constant has been chosen as 2ⁿ (2ⁿ+1) such that all residues of the scaled integer are identical and equal to the scaled integer output.This is particularly useful as no expensive and slow residue-to-binary converter is required for interfacing with conventional number system after the digital signal processing and scaling in RNS domain.The scaling error occurs only conditionally and is proven to be at most unity.The proposed architecture can be implemented entirely based on full adders with complexity commensurate with a multi-operand modulo adder.Its area-time complexity is about 2times smaller than one of the fastest based on full adders scaler architecture for the same moduli set over a wide dynamic range.