A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming

DOI10.1109/TIT.2007.907472MaRDI QIDQ3548916zbMATH OpenOpenAlexFDO

Authors Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, A. K. Khandani

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0510030

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Semidefinite programming (90C22) Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Abstract: In Multi-Input Multi-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to finding the closest lattice point in an N-dimensional complex space. In general, this problem is known to be NP hard. In this paper, we propose a quasi-maximum likelihood algorithm based on Semi-Definite Programming (SDP). We introduce several SDP relaxation models for MIMO systems, with increasing complexity. We use interior-point methods for solving the models and obtain a near-ML performance with polynomial computational complexity. Lattice basis reduction is applied to further reduce the computational complexity of solving these models. The proposed relaxation models are also used for soft output decoding in MIMO systems.

Recommendations

• Orthotope sphere decoding and parallelotope decoding-reduced complexity optimum detection algorithms for MIMO channels
• Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems
• Maximum-likelihood sequence detection of multiple antenna systems over dispersive channels via sphere decoding
• Reduced complexity \(K\) -best sphere decoder design for MIMO systems
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection

Cited in

(13)

• Orthotope sphere decoding and parallelotope decoding-reduced complexity optimum detection algorithms for MIMO channels
• SDP relaxations for some combinatorial optimization problems
• Improved nonlinear multiuser precoding using lattice reduction
• An entropy-regularized ADMM for binary quadratic programming
• Conic mixed-integer rounding cuts
• A Monte Carlo Implementation of the SAGE Algorithm for Joint Soft-Multiuser Decoding, Channel Parameter Estimation, and Code Acquisition
• Semidefinite Relaxation Approaches to Soft MIMO Demodulation for Higher Order QAM Signaling
• Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• A low complexity semidefinite relaxation for large-scale MIMO detection
• Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system
• Stable camera motion estimation using convex programming

This page was built for publication: A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548916)