SPARLS: The Sparse RLS Algorithm

We develop a recursive L 1 -regularized least squares (SPARLS) algorithm for the estimation of a sparse tap-weight vector in the adaptive filtering setting. The SPARLS algorithm exploits noisy observations of the tap-weight vector output stream and produces its estimate using an expectation-maximiza...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on signal processing Ročník 58; číslo 8; s. 4013 - 4025
Hlavní autori: Babadi, B, Kalouptsidis, N, Tarokh, V
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Adaptive filters
Algorithm design and analysis
Algorithms
Channels
compressed sensing
Computer simulation
Convergence
Error analysis
Filtering algorithms
Least squares approximation
Least squares method
Mathematical analysis
Recursive
Recursive estimation
Resonance light scattering
sparse system identification
State estimation
Steady-state
Vectors (mathematics)
Working environment noise
ISSN:1053-587X, 1941-0476
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We develop a recursive L 1 -regularized least squares (SPARLS) algorithm for the estimation of a sparse tap-weight vector in the adaptive filtering setting. The SPARLS algorithm exploits noisy observations of the tap-weight vector output stream and produces its estimate using an expectation-maximization type algorithm. We prove the convergence of the SPARLS algorithm to a near-optimal estimate in a stationary environment and present analytical results for the steady state error. Simulation studies in the context of channel estimation, employing multipath wireless channels, show that the SPARLS algorithm has significant improvement over the conventional widely used recursive least squares (RLS) algorithm in terms of mean squared error (MSE). Moreover, these simulation studies suggest that the SPARLS algorithm (with slight modifications) can operate with lower computational requirements than the RLS algorithm, when applied to tap-weight vectors with fixed support.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2010.2048103