Sparse Channel Reconstruction With Nonconvex Regularizer via DC Programming for Massive MIMO Systems

by   Pengxia Wu, et al.

Sparse channel estimation for massive multiple-input multiple-output systems has drawn much attention in recent years. The required pilots are substantially reduced when the sparse channel state vectors can be reconstructed from a few numbers of measurements. A popular approach for sparse reconstruction is to solve the least-squares problem with a convex regularization. However, the convex regularizer is either too loose to force sparsity or lead to biased estimation. In this paper, the sparse channel reconstruction is solved by minimizing the least-squares objective with a nonconvex regularizer, which can exactly express the sparsity constraint and avoid introducing serious bias in the solution. A novel algorithm is proposed for solving the resulting nonconvex optimization via the difference of convex functions programming and the gradient projection descent. Simulation results show that the proposed algorithm is fast and accurate, and it outperforms the existing sparse recovery algorithms in terms of reconstruction errors.



There are no comments yet.



Nonconvex Regularized Gradient Projection Sparse Reconstruction for Massive MIMO Channel Estimation

Novel sparse reconstruction algorithms are proposed for beamspace channe...

Cascaded Channel Estimation for Large Intelligent Metasurface Assisted Massive MIMO

In this paper, we consider the problem of channel estimation for large i...

Double-Sparsity Learning Based Channel-and-Signal Estimation in Massive MIMO with Generalized Spatial Modulation

In this paper, we study joint antenna activity detection, channel estima...

FCFGS-CV-Based Channel Estimation for Wideband MmWave Massive MIMO Systems with Low-Resolution ADCs

In this paper, the fully corrective forward greedy selection-cross valid...

DDPG-Driven Deep-Unfolding with Adaptive Depth for Channel Estimation with Sparse Bayesian Learning

Deep-unfolding neural networks (NNs) have received great attention since...

Accurate, Interpretable, and Fast Animation: An Iterative, Sparse, and Nonconvex Approach

Digital human animation relies on high-quality 3D models of the human fa...

A Method for Finding Structured Sparse Solutions to Non-negative Least Squares Problems with Applications

Demixing problems in many areas such as hyperspectral imaging and differ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.