Generation of Signed-Digit Representations for Integer Multiplication
Andrew Graham Dempster, M.D. Macleod · IEEE Signal Processing Letters · 2004
This letter presents an algorithm for generating all of the signed-digit representations of a given integer. There is an infinite number of representations, so the tree algorithm is terminated when a defined number of digits above the minimum possible is reached. It is shown that by having available these other representations, more efficient multiplication circuits can be designed than when using existing algorithms.