5 accepted papers
There is a growing research interest in proposing new techniques to detect and exploit signals/systems sparsity. Recently, the idea of hidden sparsity has been proposed, and it has been shown that, in many cases, sparsity is not explicit, and some tools are required to expose hidden sparsity. In thi…
In this paper, the localization of an emitter based on Time Difference of Arrival (TDoA) has been investigated. The classical least-squares (LS) algorithm, with a limited number of TDoA measurements, has been utilized for obtaining a closed-form solution to the source localization problem. Recently,…
In recent years, there is a growing effort in the learning algorithms area to propose new strategies to detect and exploit sparsity in the model parameters. In many situations, the sparsity is hidden in the relations among these coefficients so that some suitable tools are required to reveal the pot…
In this paper, we propose some sparsity aware algorithms, namely the Recursive least-Squares for sparse systems (S-RLS) and l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -norm Recursive least-Squares (l <sub xmlns:mml="http://www.w3.org/1998…
In this paper, we present an improved set-membership partial-update affine projection (I-SM-PUAP) algorithm, aiming at accelerating the convergence, and decreasing the update rates and the computational complexity of the set-membership partial-update affine projection (SM-PUAP) algorithm. To meet th…