Iterative reweighted l(1) design of sparse FIR filters

作者：Rusu Cristian; Dumitrescu Bogdan^*

来源：Signal Processing, 2012, 92(4): 905-911.

DOI：10.1016/j.sigpro.2011.09.031

• Sparse filters
• Reweighted l(1) minimization
• Greedy algorithms

Sparse FIR filters have lower implementation complexity than full filters, while keeping a good performance level. This paper describes a new method for designing 1D and 2D sparse filters in the minimax sense using a mixture of reweighted l(1) minimization and greedy iterations. The combination proves to be quite efficient; after the rcweighted l(1) minimization stage introduces zero coefficients in bulk, a small number of greedy iterations serve to eliminate a few extra coefficients. Experimental results and a comparison with the latest methods show that the proposed method performs very well both in the running speed and in the quality of the solutions obtained.

• 出版日期2012-4