CARRY-SAVE MULTIPLICATION SCHEMES WITHOUT FINAL ADDITION

Authors
CIMINIERA L MONTUSCHI P
Citation
L. Ciminiera et P. Montuschi, CARRY-SAVE MULTIPLICATION SCHEMES WITHOUT FINAL ADDITION, I.E.E.E. transactions on computers, 45(9), 1996, pp. 1050-1055
Citations number
17
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
45
Issue
9
Year of publication
1996
Pages
1050 - 1055
Database
ISI
SICI code
0018-9340(1996)45:9<1050:CMSWFA>2.0.ZU;2-7
Abstract
Carry-save multipliers require an adder at the last step to convert th e carry-sum representation of the most significant half of the result into a non-redundant form. This paper presents n x n multiplication sc hemes where this conversion is performed with a circuit operating in p arallel with the carry-save array. The most relevant feature of the pr oposed multipliers is that the full 2n-bit result is produced, unlike similar multiplication schemes presented in the literature.