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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Submitted to IEEE Trans. on Info. Theory, Revised

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133529

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0510030
 http://arxiv.org/abs/cs/0510030

Collections

arXiv