Loading…

Millimeter-Wave Beamformed Full-Dimensional MIMO Channel Estimation Based on Atomic Norm Minimization

The millimeter-wave (mmWave) full-dimensional (FD) MIMO system employs planar arrays at both the base station and the user equipment and can simultaneously support both azimuth and elevation beamforming. In this paper, we propose atomic-norm-based methods for mm-wave FD-MIMO channel estimation under...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2018-12, Vol.66 (12), p.6150-6163
Main Authors: Tsai, Yingming, Zheng, Le, Wang, Xiaodong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The millimeter-wave (mmWave) full-dimensional (FD) MIMO system employs planar arrays at both the base station and the user equipment and can simultaneously support both azimuth and elevation beamforming. In this paper, we propose atomic-norm-based methods for mm-wave FD-MIMO channel estimation under both uniform planar arrays (UPA) and non-uniform planar arrays (NUPA). Unlike existing algorithms, such as compressive sensing (CS) or subspace methods, the atomic-norm-based algorithms do not require to discretize the angle spaces of the angle of arrival and angle of departure into grids, thus provide much better accuracy in estimation. In the UPA case, to reduce the computational complexity, the original large-scale atomic norm minimization problem is approximately reformulated as a semi-definite program (SDP) containing two decoupled two-level Toeplitz matrices. The SDP is then solved via the alternating direction method of multipliers where each iteration involves only closed-form computations. In the NUPA case, the atomic-norm-based formulation for channel estimation becomes nonconvex and a gradient-decent-based algorithm is proposed to solve the problem. Simulation results show that the proposed algorithms achieve better performance than the CS-based and subspace-based algorithms.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2018.2864737