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

Simple item page
dc.creatorMobasher, Amin
dc.creatorTaherzadeh, Mahmoud
dc.creatorSotirov, Renata
dc.creatorKhandani, Amir K.
dc.date2005-10-12
dc.date2007-05-31
dc.date.accessioned2026-07-07T08:15:41Z
dc.date.available2026-07-07T08:15:41Z
dc.descriptionIn 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.
dc.descriptionSubmitted to IEEE Trans. on Info. Theory, Revised
dc.identifierhttps://arxiv.org/abs/cs/0510030
dc.identifierhttp://arxiv.org/abs/cs/0510030
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133529
dc.subjectInformation Theory
dc.titleA Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
dc.typetext

Files

Collections

arXiv