In this paper, a novel ROM-less RNS-to-binary converter is proposed, using a new balanced moduli set {2 2n  −1, 2 2n  + 1, 2 n  − 3, 2 n  + 3} for n even. The proposed converter is implemented with a two stage ROM-less approach, which computes the value of X based only in arithmetic operations, without using lookup tables. Experimental results for 24 to 120 bits of Dynamic Range, show that the proposed converter structure allows a balanced system with 20% faster arithmetic channels regarding the related state of the art, while requiring similar area resources. This improvement in the channel's performance is enough to offset the higher conversion costs of the proposed converter. Furthermore, up to 20% better Power-Delay-Product efficiency metric can be achieved for the full RNS architecture using the proposed moduli set.
['Pedro Miguens Matutino', 'Ricardo Chaves', 'Leonel Sousa']
ROM-less RNS-to-binary converter moduli {2 2n − 1, 2 2n + 1, 2 n − 3, 2 n + 3}