This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Modified Booth Modulo 2^n-1 Multipliers
March 2004 (vol. 53 no. 3)
pp. 370-374

Abstract2^n-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 2^n-1 multipliers, which, for even values of n, 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.

[1] M.A. Soderstrand et al., Residue Number System Arithmetic: Modern Applications in Digital Signal Processing. IEEE Press, 1986.
[2] V. Paliouras and T. Stouraitis, Novel High-Radix Residue Number System Multipliers and Adders Proc. IEEE Int'l Symp. Circuits and Systems, pp. 451-454, 1999.
[3] W. Wang et al., A High-Speed Residue-to-Binary Converter for Three-Moduli$(2^k, 2^k-1, 2^{k-1}-1)$RNS and a Scheme for Its VLSI Implementation IEEE Trans. Circuits and Systems II, vol. 47, no. 12, pp. 1576-1581, 2000.
[4] Y. Wang et al., Adder Based Residue to Binary Number Converters for$(2^n-1, 2^n, 2^n + 1)$ IEEE Trans. Signal Processing, vol. 50, no. 7, pp. 1772-1779, 2002.
[5] A. Skavantzos and P.B. Rao, New Multipliers Modulo$2^n-1$ IEEE Trans. Computers, vol. 41, no. 8, pp. 957-961, Aug. 1992.
[6] Z. Wang, G.A. Jullien, and W.C. Miller, An Algorithm for Multiplication Modulo$(2^n-1)$ Proc. 39th Midwest Symp. Circuits and Systems, pp. 1301-1304, 1997.
[7] R. Zimmerman, Efficient VLSI Implementation of Modulo$(2^n\pm 1)$Addition and Multiplication Proc. 14th IEEE Symp. Computer Arithmetic, pp. 158-167, Apr. 1999.
[8] C. Efstathiou, D. Nikolos, and J. Kalamatianos, Area-Time Efficient Modulo$2^n-1$Adder Design IEEE Trans. Circuits and Systems II, vol. 41, no. 7, pp. 463-467, 1994.
[9] L. Kalampoukas et al., High-Speed Parallel-Prefix Modulo$2^n-1$Adders IEEE Trans. Computers, vol. 49, no. 7, pp. 673-680, July 2000.
[10] I. Koren, Computer Arithmetic Algorithms, second ed. Natick, Mass.: A.K. Peters, 2002.
[11] A. Tyagi, A Reduced-Area Scheme for Carry-Select Adders IEEE Trans. Computers, vol. 42, no. 10, Oct. 1993.

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
Usage of this product signifies your acceptance of the Terms of Use.