Design of sparse FIR filters based on branch-and-bound algorithm

Branch-and-bound algorithm is applied to the design of sparse FIR filters having intentionally zeroed tap positions. It is shown that this algorithm coupled with a suitable optimization technique for filter design can lead to an optimal sparse FIR filter satisfying given specifications. Design examples demonstrate that the proposed method requires less computation than the conventional optimization such as the subset selection method.