Name
Abstract | ||
|---|---|---|
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplified search of the filter support that relies on a neighbor permutation technique. For relatively small window size, the proposed algorithm has a lower complexity than recent exponential window RLS algorithms. Time-varying FIR channel identification simulations show that the proposed algorithm can also give better mean squared coefficient errors. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICASSP.2011.5947208 | 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING |
Keywords | DocType | ISSN |
adaptive algorithm, recursive least squares, sliding window, sparse filters | Conference | 1520-6149 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandru Onose | 1 | 12 | 3.93 |
| Bogdan Dumitrescu | 2 | 107 | 22.76 |
| Ioan Tabus | 3 | 276 | 38.23 |