Online adaptive algorithms have been largely applied for recursive estimation and tracking of sparse signals. In this paper we propose a distributed recursive least squares (RLS) algorithm incorporating an l 1-norm regularization with time-varying regularization coefficient that enables a recursive distributed solution with no losses with respect to the centralized solution. The method is especially useful in cooperative sensing when the parameters to be estimated are structurally sparse and time-varying. As well known, the l1-norm is useful to recover sparsity, but it also introduces a non negligible bias. To tackle this issue, we further apply a garotte correction to our distributed mechanism that strongly reduces the bias. Numerical results are included to validate the estimation and tracking capabilities of the proposed algorithm. © 2013 IEEE.
DISTRIBUTED RLS ESTIMATION FOR COOPERATIVE SENSING IN SMALL CELL NETWORKS
SARDELLITTI, Stefania;
2013-01-01
Abstract
Online adaptive algorithms have been largely applied for recursive estimation and tracking of sparse signals. In this paper we propose a distributed recursive least squares (RLS) algorithm incorporating an l 1-norm regularization with time-varying regularization coefficient that enables a recursive distributed solution with no losses with respect to the centralized solution. The method is especially useful in cooperative sensing when the parameters to be estimated are structurally sparse and time-varying. As well known, the l1-norm is useful to recover sparsity, but it also introduces a non negligible bias. To tackle this issue, we further apply a garotte correction to our distributed mechanism that strongly reduces the bias. Numerical results are included to validate the estimation and tracking capabilities of the proposed algorithm. © 2013 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.