An Efficient CRT-Base Power-of-Two Scaling in Minimally Redundant Residue Number System

In this paper, we consider one of the key problems in modular arithmetic. It is known that scaling in the residue number system (RNS) is a rather complicated non-modular procedure, which requires expensive and complex operations at each iteration. Hence, it is time consuming and needs too much hardware for implementation. We propose a novel approach to power-of-two scaling based on the Chinese Remainder Theorem (CRT) and rank form of the number representation in RNS. By using minimal redundancy of residue code, we optimize and speed up the rank calculation and parity determination of divisible integers in each iteration. The proposed enhancements make the power-of-two scaling simpler and faster than the currently known methods. After calculating the rank of the initial number, each iteration of modular scaling by two is performed in one modular clock cycle. The computational complexity of the proposed method of scaling by a constant [Formula: see text] associated with both required modular addition operations and lookup tables is estimeted as k and [Formula: see text] , respectively, where k equals the number of primary non-redundant RNS moduli. The time complexity is [Formula: see text] modular clock cycles.