Tightness of a new and enhanced semidefinite relaxation for MIMO detection
arXiv:1710.02048
Abstract
In this paper, we consider a fundamental problem in modern digital communications known as multi-input multi-output (MIMO) detection, which can be formulated as a complex quadratic programming problem subject to unit-modulus and discrete argument constraints. Various semidefinite relaxation (SDR) based algorithms have been proposed to solve the problem in the literature. In this paper, we first show that the conventional SDR is generally not tight for the problem. Then, we propose a new and enhanced SDR and show its tightness under an easily checkable condition, which essentially requires the level of the noise to be below a certain threshold. The above results have answered an open question posed by So in [35]. Numerical simulation results show that our proposed SDR significantly outperforms the conventional SDR in terms of the relaxation gap.
arXiv comment24 pages, 2 figures, accepted for publication in SIAM Journal on Optimization
References in corpus (7)
- Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
- Designing Unimodular Codes via Quadratic Optimization is not Always Hard
- Nonconvex phase synchronization
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- When Are Nonconvex Problems Not Scary?
- One-Bit Precoding and Constellation Range Design for Massive MIMO with QAM Signaling
- Open problem: Tightness of maximum likelihood semidefinite relaxations