Iteratively reweighted two-stage LASSO for block-sparse signal recovery under finite-alphabet constraints

Abstract

In this paper, we derive an efficient iterative algorithm for the recovery of block-sparse signals given the finite data alphabet and the non-zero block probability. The non-zero block number is supposed to be far smaller than the total block number (block-sparse).The key principle is the separation of the unknown signal vector into an unknown support vector s and an unknown data symbol vector a. Both number ( s 0 ) and positions (s i ∈ {0, 1}) of non-zero blocks are unknown. The proposed algorithms use an iterative two-stage LASSO procedure consisting in optimizing the recovery problem alternatively with respect to a and with respect to s. The first algorithm resorts on 1 -norm of the support vector and the second one applies reweighted 1 -norm, which further improves the recovery performance. Performance of proposed algorithms is illustrated in the context of sporadic multiuser communications. Simulations show that the reweighted-1 algorithm performs close to its lower bound (perfect knowledge of the support vector).

Discreteness and group sparsity aware detection for uplink overloaded MU-MIMO systems

“…Note that not only is sparse, but multiple transmitted symbols from the non-active IoT terminal become zero simultaneously when OFDM or SC-CP signaling is employed. Such group sparsity has been utilized as prior knowledge in the literature of compressed sensing and sparse regression [25–27] as well as wireless communications [28, 29]. Thus, we can expect a certain improvement of the detection performance by using the group sparsity of the transmitted signal vector .…”

Iterative descent group hard thresholding algorithms for block sparsity

“…It ensures sparsity of the solution, but the group sparsity may not occur in all situations. More generally, several criteria and applications have been considered in the literature to take block sparsity into account (see for instance [16,17,18] for some recent references).…”

Relaxed Inertial Projective Forward-backward Splitting Algorithms for Regularized Least Square Problems

“…Many problems in optimization can be formulated to solved problems (1.1)-(1.3), see [1,6,7,10,12,18]. We focus on variational inclusion problems (VIP) which are defined in a real Hilbert space H: to find an element x ∈ H such that…”