RNS-to-binary conversion for efficient VLSI implementation

Conversion from a residue number system (RNS) to binary is a crucial point in the implementation of modular processors. The choice of the moduli is strictly related to conversion performance and influences the processor complexity. In this paper, a conversion method based on a class of couples of coprime moduli defined as (n-2^k, n+2^k) is presented. The method and the related architecture can easily be extended to a larger number of moduli. Since it is based on very small look-up tables, the proposed method can be implemented by fast and low complex architectures