This Article 
 Bibliographic References 
 Add to: 
Carry-Save Multiplication Schemes Without Final Addition
September 1996 (vol. 45 no. 9)
pp. 1050-1055

Abstract—Carry-save multipliers require an adder at the last step to convert the carry-sum representation of the most significant half of the result into a non-redundant form. This paper presents n×n multiplication schemes where this conversion is performed with a circuit operating in parallel with the carry-save array. The most relevant feature of the proposed multipliers is that the full 2n-bit result is produced, unlike similar multiplication schemes presented in the literature.

[1] A. Avizienis, "Signed-Digit Number Representation for Fast Parallel Arithmetic," IRE Trans. Electron. Comput., vol. 10, pp. 389-400, Sept. 1961.
[2] W. Balakrishnan and N. Burgess, "Very-High-Speed VLSI 2s-Complement Multiplier Using Signed Binary Digits," IEE Proc., Part E, vol. 139, no. 1, pp. 29-34, Jan. 1992.
[3] C.R. Baugh and B.A. Wooley, "A Two's Complement Parallel Array Multiplication Algorithm," IEEE Trans. Computers, vol. 22, no. 12, pp. 1,045-1,047, Dec. 1973.
[4] P.E. Blankenship, "Comments on 'A Two's Complement Parallel Array Multiplication Algorithm,'" IEEE Trans. Computers, vol. 23, p. 1,327, 1974.
[5] A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mech. Appl. Math., vol. 4, Part 2, pp. 236-240, 1951.
[6] P.R. Capello and K. Steiglitz, "A VLSI Layout for a Pipeline Dadda Multiplier," ACM Trans. Computer Design, vol. 1, no. 2, pp. 157-174, May 1983.
[7] L. Ciminiera and P. Montuschi, "Carry-Sum to Conventional Representation On-the-Fly Conversion and Its Application to the Design of Multipliers," I.R. DAI/ARC 6-93.
[8] L. Dadda, "Some Schemes for Parallel Multipliers," Alta Frequenza, vol. 34, pp. 349-356, Mar. 1965.
[9] M.D. Ercegovac and T. Lang,"On-the-Fly Conversion of Redundant into Conventional Representations," IEEE Trans. Computers, vol. 36, pp. 895-897, 1987.
[10] M.D. Ercegovac et al., Fast Multiplication without Carry-Propagate Addition , IEEE Trans. Computers, vol. 39, no. 11, Nov. 1990.
[11] K. Hwang,Computer Arithmetic, Principles, Architecture, and Design.New York: John Wiley&Sons, 1979.
[12] S. Kuninobu et al., "Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation," Proc. 8th IEEE Symp. Computer Arithmetic,Como, Italy, pp. 80-85, May 1987.
[13] S. Nakamura, "Algorithm for Iterative Array Multiplication," IEEE Trans. Computers, vol. 35, no. 8, pp. 713-719, Aug. 1986.
[14] M. Putrino, S. Vassiliadis, and E.M. Schwarz, "Array Two's Complement and Square Function," Electron. Lett., vol. 23, no. 22, pp. 1,185-1,187, Oct. 1987.
[15] E.E. Swartzlander, "The Quasi-Serial Multiplier," IEEE Trans. Computers, vol. 22, pp. 317-321, Apr. 1973.
[16] S. Vassiliadis, E.M. Schwarz, and B.M. Sung, "Hard-Wired Multipliers with Encoded Partial Products," IEEE Trans. Computers, vol. 40, no. 11, pp. 1,181-1,197, Nov. 1991.
[17] C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electron. Comput., vol. 13, pp. 14-17, Feb. 1964.
[18] Z. Wang, G.A. Jullien, and W.C. Miller, "An Architecture for Parallel Multipliers," Proc. 25th IEEE Asilomar Conf., pp. 403-407,Pacific Grove, Calif., Nov. 1991.

Index Terms:
Carry-save addition, multipliers, multiplication, on-the-fly conversion, redundant number representations.
Luigi Ciminiera, Paolo Montuschi, "Carry-Save Multiplication Schemes Without Final Addition," IEEE Transactions on Computers, vol. 45, no. 9, pp. 1050-1055, Sept. 1996, doi:10.1109/12.537128
Usage of this product signifies your acceptance of the Terms of Use.