Name
Abstract | ||
|---|---|---|
In this paper, we consider a fundamental problem in modern digital communications known as multiple-input multiple-output (MIMO) detection, which can be formulated as a complex quadratic programming problem subject to unit-modulus and discrete argument constraints. Various semidefinite-relaxation-based (SDR-based) algorithms have been proposed to solve the problem in the literature. In this paper, we first show that 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 [Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), SIAM, Philadelphia, PA, 2011, pp. 698-711]. Numerical simulation results show that our proposed SDR significantly outperforms the conventional SDR in terms of the relaxation gap. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/17M115075X | SIAM JOURNAL ON OPTIMIZATION |
Keywords | Field | DocType |
complex quadratic programming,semidefinite relaxation,MIMO detection,tight relaxation | Mathematical optimization,MIMO,Quadratic equation,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 1 | 1052-6234 |
Citations | PageRank | References |
4 | 0.42 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheng Lu | 1 | 40 | 5.14 |
| Y. F. Liu | 2 | 454 | 30.59 |
| Wei-Qiang Zhang | 3 | 136 | 31.22 |
| Shuzhong Zhang | 4 | 2808 | 181.66 |