Iterative reweighted l1 design of sparse FIR filters

Rusu, Cristian and Dumitrescu, Bogdan Iterative reweighted l1 design of sparse FIR filters. Signal Processing, 92 (4). pp. 905-911. ISSN 0165-1684 (2012)

Preview

PDF - Submitted Version Download (350kB) | Preview

Abstract

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 l1 minimization and greedy iterations. The combination proves to be quite efficient; after the reweighted l1 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.

Item Type:	Article
Identification Number:	https://doi.org/10.1016/j.sigpro.2011.09.031
Uncontrolled Keywords:	Sparse filters; Reweighted l1 minimization; Greedy algorithms
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Users 45 not found.
Date Deposited:	07 Mar 2013 13:48
Last Modified:	12 Mar 2013 14:58
URI:	http://eprints.imtlucca.it/id/eprint/1529

Actions (login required)

Edit Item