A variant of a radix-10 combinational multiplier

— We consider the problem of adding the partial products in the combinational decimal multiplier presented by Lang and Nannarelli. In the original paper this addition is done with a tree of decimal carry-save adders. In this paper, we treat the problem using the multi-operand decimal addition previously published by Dadda, where the sum of each column of the partial product array is obtained first in binary form and then converted to decimal. The multiplication, using a 90 nm CMOS technology, in this modified scheme takes 2.51 ns, while in the original scheme it takes 2.65 ns. The area of the two schemes is roughly the same.

• Type: Conference
• Year: 2008
• Where: ISCAS
• Authors: Luigi Dadda, Alberto Nannarelli
• Keywords: Decimal Carry-save Adders, Hardware, ISCAS 2008, Multi-operand Decimal Addition, Partial Product