A fast and accurate RNS scaling technique for high speed signal processing

Abstract

A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed. This technique obtains the residues of the scaled integer, when scaled by a product of a subset of the moduli, in approximately log n cycles, where n is the total number of moduli in the RNS. The scaled integer has an error of at most unity. The technique is based on a judicious decomposition of the Chinese remainder theorem (CRT) and the use of a redundant channel which carries (at the least) the odd-even information about the integer being scaled. >