New CRT-Based RNS converter using restricted moduli set
This paper presents a new FINS converter using any number of relatively prime moduli of the form 2(n) and 2(n) +/- 1. With the exception of common 3 moduli sets such as {2(n) - 1, 2(n), 2(n) + 1}, RNS output converters based on the CRT require the computation of a sum of products modulo a large number. The new converter presented in this paper uses the fractional representation for the output and eliminates the requirement for multiplications, thereby reducing area and delay. Further area improvements are possible by exploiting the period of terms to be added. An algorithmic approach is used to obtain full adder-based architectures that are optimized for area and delay.
residue number system (rns) converter chinese remainder theorem (crt)