eprintid: 1529
rev_number: 9
eprint_status: archive
userid: 45
dir: disk0/00/00/15/29
datestamp: 2013-03-07 13:48:00
lastmod: 2013-03-12 14:58:11
status_changed: 2013-03-07 13:48:00
type: article
metadata_visibility: show
creators_name: Rusu, Cristian
creators_name: Dumitrescu, Bogdan
creators_id: cristian.rusu@imtlucca.it
creators_id: 
title: Iterative reweighted l1 design of sparse FIR filters
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: Sparse filters; Reweighted l1 minimization; Greedy algorithms
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.
date: 2012
date_type: published
publication: Signal Processing
volume: 92
number: 4
publisher: Elsevier
pagerange: 905-911
id_number: 10.1016/j.sigpro.2011.09.031
refereed: TRUE
issn: 0165-1684
official_url: http://dx.doi.org/10.1016/j.sigpro.2011.09.031
citation:   Rusu, Cristian and Dumitrescu, Bogdan  Iterative reweighted l1 design of sparse FIR filters.  Signal Processing, 92 (4).  pp. 905-911.  ISSN 0165-1684      (2012)  
document_url: http://eprints.imtlucca.it/1529/1/Iterative%20reweighted%20l1%20design%20of%20sparse%20FIR%20filters.pdf