DocumentCode :
2461243
Title :
n × n carry-save multipliers without final addition
Author :
Montuschi, Paolo ; Ciminiera, Luigi
Author_Institution :
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
fYear :
1993
fDate :
29 Jun-2 Jul 1993
Firstpage :
54
Lastpage :
61
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 an irredundant form. A multiplication scheme where by this conversion is performed with a circuit operating in parallel with the carry-save array is presented. The resulting implementation, when a radix-2 adder array is used, produces a result on 2n bits with a delay comparable to that of the multiplier proposed by M.D. Ercegovac and T. Lang (1990). When a radix-4 array is used, the proposed unit is almost twice as fast as units proposed previously
Keywords :
multiplying circuits; adder; carry-save multipliers; carry-sum representation; multiplication scheme; radix-2 adder array; radix-4 array; Counting circuits; Delay effects; Hardware; Phased arrays; Proposals;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Arithmetic, 1993. Proceedings., 11th Symposium on
Conference_Location :
Windsor, Ont.
Print_ISBN :
0-8186-3862-1
Type :
conf
DOI :
10.1109/ARITH.1993.378109
Filename :
378109
Link To Document :
بازگشت