A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
From MaRDI portal
Publication:3548916
DOI10.1109/TIT.2007.907472zbMath1325.94066arXivcs/0510030OpenAlexW2177435529MaRDI QIDQ3548916
Amir K. Khandani, Renata Sotirov, Mahmoud Taherzadeh, Amin Mobasher
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
Semidefinite programming (90C22) Bounds on codes (94B65) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (8)
Conic mixed-integer rounding cuts ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection ⋮ Improved nonlinear multiuser precoding using lattice reduction
This page was built for publication: A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
