A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
Authors:
- Renata SotirovRSRenata Sotirov
- Amir K. KhandaniAKAmir K. Khandani
- 29 October 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (11) , 3869-3886
Abstract
In multiple-input multiple-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, a quasi-ML algorithm based on semi-definite programming (SDP) is proposed. 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.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- On the Optimality of the Binary Reflected Gray CodeIEEE Transactions on Information Theory, 2004
- Universal lattice decoding: principle and recent advancesWireless Communications and Mobile Computing, 2003
- Achieving near-capacity on a multiple-antenna channelIEEE Transactions on Communications, 2003
- Layered space-time architecture for wireless communication in a fading environment when using multi-element antennasBell Labs Technical Journal, 2002
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Semidefinite programming relaxations for the graph partitioning problemDiscrete Applied Mathematics, 1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Mixed linear and semidefinite programming for combinatorial and quadratic optimizationOptimization Methods and Software, 1999
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985
- Cancellation techniques of co‐channel interference in asynchronous spread spectrum multiple access systemsElectronics and Communications in Japan (Part I: Communications), 1983