The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM
arXiv:0809.4529 · doi:10.1109/JSTSP.2009.2035798
Abstract
In multi-input-multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. Developed initially for BPSK and QPSK, SDR has been found to be capable of providing near-optimal performance (for those constellations). This has stimulated a number of recent research endeavors that aim to apply SDR to the high-order QAM cases. These independently developed SDRs are different in concept and structure, and presently no serious analysis has been given to compare these methods. This paper analyzes the relationship of three such SDR methods, namely the polynomial-inspired SDR (PI-SDR) by Wiesel et al., the bound-constrained SDR (BC-SDR) by Sidiropoulos and Luo, and the virtually-antipodal SDR (VA-SDR) by Mao et al. The result that we have proven is somehow unexpected: the three SDRs are equivalent. Simply speaking, we show that solving any one SDR is equivalent to solving the other SDRs. This paper also discusses some implications arising from the SDR equivalence, and provides simulation results to verify our theoretical findings.
Submitted to IEEE Journal of Selected Topics in Signal Processing, Aug 2008
References in corpus (2)
Cited by in corpus (7)
- Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
- A Survey on Design and Performance of Higher-Order QAM Constellations
- Integrated Semi-definite Relaxation Receiver for LDPC-Coded MIMO Systems
- Non-iterative Joint Detection-Decoding Receiver for LDPC-Coded MIMO Systems Based on SDR
- Tightness and Equivalence of Semidefinite Relaxations for MIMO Detection
- The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems
- On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations