Arithmetic operations on Binary Signed-Digit (BSD) number system are performed in a constant time due to the carry free addition capability in redundant number system. Applying BSD number representation to Residue Number System (RNS) leads to a number system called BSD-RNS. There are three BSD-RNS encodings: 2’s complement, 1-out-of-3, and posibit-negabit. Up to now, BSD-RNS multipliers with 2’s complement and 1-out-of-3 encoding have been reported in the related literatures. In this work, we propose posibit-negabit BSDRNS multiplier for the moduli set {2^n-1, 2^n, 2^n+1}. Afterwards, we compare it to the existing BSD-RNS multipliers. Synthesis results show that the proposed architecture is more efficient than the two existing BSD-RNS multipliers from the viewpoint of delay, area, and power consumption.
Saremi,M. and Timarchi,S. (2012). Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}. (e216066). The CSI Journal on Computer Science and Engineering, 9(2), e216066
MLA
Saremi,M. , and Timarchi,S. . "Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}" .e216066 , The CSI Journal on Computer Science and Engineering, 9, 2, 2012, e216066.
HARVARD
Saremi M., Timarchi S. (2012). 'Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}', The CSI Journal on Computer Science and Engineering, 9(2), e216066.
CHICAGO
M. Saremi and S. Timarchi, "Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}," The CSI Journal on Computer Science and Engineering, 9 2 (2012): e216066,
VANCOUVER
Saremi M., Timarchi S. Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}. CSIonJCSE, 2012; 9(2): e216066.
The CSI Journal on Computer Science and Engineering