A Residue-to-Binary Converter with an Adjustable Structure for an Extended RNS Three-Moduli Set

摘要

In earlier publications, many researchers have addressed the problem of residue-to-binary conversion for the popular moduli set (2(n); 2(n) - 1; 2(n) + 1), where n is a positive integer greater than 1. In this paper, we are proposing, potentially, the fastest converter ever for this moduli set with the least hardware requirements. Moreover, the paper revisits the extended three-moduli set (2(n+p); 2(n) - 1; 2(n) + 1), where p is a positive integer such that 0 p = n. This paper proposes an efficient residue-to-binary converter with an adjustable structure. The proposed structure allows increasing the dynamic range at a cost of two gates per bit. When compared with a similar published work for the extended moduli set, the proposed extended converter showed significant reductions in area by 9.9-13.4%, in delay by 16.9-24.1% and in power consumption by 10.6-16.7%.