The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2004 vol.53)
pp: 370-374
D. Nikolos , IEEE
ABSTRACT
<p><b>Abstract</b>—<tmath>2^n-1</tmath> 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 <tmath>2^n-1</tmath> multipliers, which, for even values of <tmath>n</tmath>, require one less partial product than the already known. CMOS implementations reveal that the proposed multipliers compared to earlier solutions offer savings up to 28.7 percent and up to 29.3 percent in the implementation area and execution delay, respectively.</p>
INDEX TERMS
Residue Number System, Mersenne arithmetic, one's complement arithmetic, Booth multipliers, VLSI design.
CITATION
C. Efstathiou, H.T. Vergos, D. Nikolos, "Modified Booth Modulo 2^n-1 Multipliers", IEEE Transactions on Computers, vol.53, no. 3, pp. 370-374, March 2004, doi:10.1109/TC.2004.1261842
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool