Least-squared Design of Sparse FIR Filters by Combinatorial Optimization
Taro Itani, Masayoshi Nakamoto, Katsumi Konishi · IEEJ Transactions on Electronics Information and Systems · 2020
In order to reduce the computation amount of FIR filters, we consider design sparse FIR filters by using combinatorial optimization. We also consider solve this optimization problem by using branch and bound method. The computation time for this optimization depends on the initial reference value of branch and bound method. This paper proposes the method to estimate the initial cost value to improve the efficiency for the sparse FIR filter design.