We examine the application of Hartley's subexpression elimination algorithm to sets of coefficients that are represented all combinations signed-digits including those that require more digits than CSD. FIR filters using this method can use fewer adders than those designed by the best of existing techniques. However, the search space for practical filters means that exhaustive searching is impractical.