Carry-save multiplication schemes without final addition | IEEE Journals & Magazine | IEEE Xplore

Carry-save multiplication schemes without final addition


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. Thi...Show More

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/spl times/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.
Published in: IEEE Transactions on Computers ( Volume: 45, Issue: 9, September 1996)
Page(s): 1050 - 1055
Date of Publication: 06 August 2002

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.