A Caltech Library Service

Linear Programming Detection and Decoding for MIMO Systems

Cui, Tao and Ho, Tracey and Tellambura, Chintha (2006) Linear Programming Detection and Decoding for MIMO Systems. In: 2006 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 1783-1787. ISBN 1-4244-0505-X.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We develop an efficient linear programming detector (LPD) for multiple-input multiple-output (MIMO) systems. Instead of using the usual l2 norm, our proposed LPD uses the l1 norm as the detection metric, resulting in a mixed-integer linear program (MILP). Two branch-and-bound algorithms are proposed to solve the MILP. The solution of the MILP achieves the same full diversity order as the maximum likelihood detector. The MILP is further relaxed to a linear program (LP), which can be readily solved using the standard simplex method. We show that in some cases the solution of the LP is guaranteed to be that of the MILP. The LPD is also extended to the joint detection and decoding of linear block coded MIMO systems. Our LPD can be immediately implemented using mature circuits design for the simplex algorithm.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2006 IEEE. This work was supported in part by Caltech’s Lee Center for Advanced Networking.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20170515-163823021
Persistent URL:
Official Citation:T. Cui, T. Ho and C. Tellambura, "Linear Programming Detection and Decoding for MIMO Systems," 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 1783-1787. doi: 10.1109/ISIT.2006.261741
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77474
Deposited On:16 May 2017 03:15
Last Modified:15 Nov 2021 17:31

Repository Staff Only: item control page