Sliding window greedy RLS for sparse filters


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… (More)
DOI: 10.1109/ICASSP.2011.5947208


5 Figures and Tables