NORMA eResearch @NCI Library

Iterative reweighted l1 design of sparse FIR filters

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

Full text not available from this repository.
Official URL:


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
Subjects: Q Science > QA Mathematics > Electronic computers. Computer science
T Technology > T Technology (General) > Information Technology > Electronic computers. Computer science
Divisions: School of Computing > Staff Research and Publications
Depositing User: Caoimhe Ní Mhaicín
Date Deposited: 03 Jul 2018 11:52
Last Modified: 03 Jul 2018 11:52

Actions (login required)

View Item View Item