A New Proposed Modulo 2~n-1 Multiplier

2n-1 is one of the most commonly used moduli in Residue Number Systems.In this paper,we propose a new method for designing modified Booth modulo 2n-1 multipliers,which,for even values of n,require one less partial product than the already known.the proposed multipliers compared to earlier solutions offer savings up to 9 percent and up to 2.4 percent in the implementation area and execution delay,respectively.