Efficient 1-out-of-3 Binary Signed-Digit multiplier for the moduli set {2n-1, 2n, 2n+1}

Utilizing Binary Signed-Digit (BSD) number representation in RNS arithmetic is called BSD-RNS. Up to the present, 2´s complement BSD-RNS has been proposed. In this work, we utilize 1-out-of-3 encoding to represent residues in BSD-RNS. This paper proposes efficient modular multipliers for the moduli set {2ⁿ-1, 2ⁿ, 2ⁿ+1} based on 1-out-of-3 BSD number system. Compared to efficient 2´s complement BSD-RNS multiplier, proposed architecture has 8% less delay and 5% less area.