Abstract
Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared. It is found that scaling in RNS has been performed with the aid of conversions to and from RNS, bse extensions between modulus sets, and redundant RNS channels. Recent advances in RNS scaling theory have reduced the overhead of such measures but RNS scaling still falls short of the ideal: a simple operation performed entirely within the RNS channels.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call