Robust Precoding Design for Coarsely Quantized MU-MIMO Under Channel Uncertainties-V0

Recently, multi-user multiple input multiple output (MU-MIMO) systems with low-resolution digital-to-analog converters (DACs) has received considerable attention, owing to the capability of dramatically reducing the hardware cost. Besides, it has been shown that the use of low-resolution DACs enable great reduction in power consumption while maintain the performance loss within acceptable margin, under the assumption of perfect knowledge of channel state information (CSI). In this paper, we investigate the precoding problem for the coarsely quantized MU-MIMO system without such an assumption. The channel uncertainties are modeled to be a random matrix with finite second-order statistics. By leveraging a favorable relation between the multi-bit DACs outputs and the single-bit ones, we first reformulate the original complex precoding problem into a nonconvex binary optimization problem. Then, using the S-procedure lemma, the nonconvex problem is recast into a tractable formulation with convex constraints and finally solved by the semidefinite relaxation (SDR) method. Compared with existing representative methods, the proposed precoder is robust to various channel uncertainties and is able to support a MU-MIMO system with higher-order modulations, e.g., 16QAM.

[1]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[2]  T. Markham,et al.  Generalized Inverse Formulas Using the Schur Complement , 1974 .

[3]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[4]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[5]  Cheng Tao,et al.  Downlink Achievable Rate Analysis in Massive MIMO Systems With One-Bit DACs , 2016, IEEE Communications Letters.

[6]  Josef A. Nossek,et al.  Linear transmit processing in MIMO communications systems , 2005, IEEE Transactions on Signal Processing.

[7]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[8]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[9]  L. Chu Efficient Nonlinear Precoding for Massive MU-MIMO Downlink Systems with 1-Bit DACs , 2018 .

[10]  Robert W. Heath,et al.  Limited Feedback in Single and Multi-User MIMO Systems With Finite-Bit ADCs , 2018, IEEE Transactions on Wireless Communications.

[11]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[12]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

[13]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[14]  Michael Meurer,et al.  Imperfect channel-state information in MIMO transmission , 2006, IEEE Transactions on Communications.

[15]  Tom Goldstein,et al.  Quantized Precoding for Massive MU-MIMO , 2016, IEEE Transactions on Communications.

[16]  Erik G. Larsson,et al.  Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..

[17]  Shi Jin,et al.  Finite-Alphabet Precoding for Massive MU-MIMO With Low-Resolution DACs , 2017, IEEE Transactions on Wireless Communications.

[18]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[19]  Erik G. Larsson,et al.  Massive MIMO for next generation wireless systems , 2013, IEEE Communications Magazine.