A recently proposed technique for common-multiplicand multiplication o
f binary numbers is shown to be applicable to signed-digit numbers. Th
e authors prove that multiplication of a single k-bit multiplicand by
n k-bit multipliers can be performed using 0.306nk additions for canon
ically recoded signed-digit numbers, whereas the binary case requires
0.375nk additions.