Using all signed-digit representations to design single integer multipliers using subexpression elimination

Abstract

A new algorithm is introduced for design of integer multipliers using subexpression elimination. Hartley's algorithm for subexpression elimination is applied to all possible signed-digit representations of the integer. Results are within 1% of the slow optimal exhaustive searches for 19-bit integers.