Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/84426

An Online Parallel Algorithm for Recursive Estimation of Sparse Signals

Authors Yang, Yang
Pesavento, Marius
Zhang, Mengyi
Palomar, Daniel Perez View this author's profile
Issue Date 2016
Source IEEE Transactions on Signal and Information Processing over Networks , v. 2, (3), September 2016, p. 290-305
Summary In this paper, we consider a recursive estimation problem for linear regression where the signal to be estimated admits a sparse representation and measurement samples are only sequentially available. We propose a convergent parallel estimation scheme that consists of solving a sequence of ℓ1-regularized least-square problems approximately. The proposed scheme is novel in three aspects: 1) all elements of the unknown vector variable are updated in parallel at each time instant, and the convergence speed is much faster than state-of-the-art schemes which update the elements sequentially; 2) both the update direction and stepsize of each element have simple closed-form expressions, so the algorithm is suitable for online (real-time) implementation; and 3) the stepsize is designed to accelerate the convergence but it does not suffer from the common intricacy of parameter tuning. Both centralized and distributed implementation schemes are discussed. The attractive features of the proposed algorithm are also illustrated numerically.
Subjects
ISSN 2373-776X
Language English
Format Article
Access View full-text via DOI
Find@HKUST