Lower Bounds for Constant Multiplication Problems
Oscar Gustafsson · IEEE Transactions on Circuits & Systems II Express Briefs · 2007
Lower bounds for problems related to realizing multiplication by constants with shifts, adders, and subtracters are presented. These lower bounds are straightforwardly calculated and have applications in proving the optimality of solutions obtained by heuristics.