Issue No. 09 - September (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.537128
<p><b>Abstract</b>—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 <it>n</it>×<it>n</it> 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 2<it>n</it>-bit result is produced, unlike similar multiplication schemes presented in the literature.</p>
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. , pp. 1050-1055, September 1996, doi:10.1109/12.537128