Matrix-lifting semidefinite programming for detection in multiple antenna systems

A. Mobasher, R. Sotirov, A.K. Khandani

Research output: Contribution to journalArticleScientificpeer-review

Abstract

This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting semi-definite programming (SDP). The strength of the proposed method lies in a new relaxation approach applied to the previous work by Mobasher This results in a reduction of the number of variables from (NK + 1)(NK + 2)/2, in the previous work by Mobasher to (2N +K)2 , in the new method, where N is twice the number of transmit antennas and K is the number of constellation points in each real dimension. It is shown that this reduction in the number of variables results in a significant computational complexity reduction compared to the previous work by Mobasher Moreover, the proposed method offers a better symbol error rate performance as compared to some known and recent SDP-based quasi-maximum likelihood detection methods reported in the literature.
Original languageEnglish
Pages (from-to)5178-5185
JournalIEEE Transactions on Signal Processing
Volume58
Issue number10
Publication statusPublished - 2010

Fingerprint

Antennas
Phase shift keying
Quadrature amplitude modulation
Labeling
Maximum likelihood
Computational complexity

Cite this

@article{aed005baefae455f81e09c0def063d25,
title = "Matrix-lifting semidefinite programming for detection in multiple antenna systems",
abstract = "This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting semi-definite programming (SDP). The strength of the proposed method lies in a new relaxation approach applied to the previous work by Mobasher This results in a reduction of the number of variables from (NK + 1)(NK + 2)/2, in the previous work by Mobasher to (2N +K)2 , in the new method, where N is twice the number of transmit antennas and K is the number of constellation points in each real dimension. It is shown that this reduction in the number of variables results in a significant computational complexity reduction compared to the previous work by Mobasher Moreover, the proposed method offers a better symbol error rate performance as compared to some known and recent SDP-based quasi-maximum likelihood detection methods reported in the literature.",
author = "A. Mobasher and R. Sotirov and A.K. Khandani",
year = "2010",
language = "English",
volume = "58",
pages = "5178--5185",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

Matrix-lifting semidefinite programming for detection in multiple antenna systems. / Mobasher, A.; Sotirov, R.; Khandani, A.K.

In: IEEE Transactions on Signal Processing, Vol. 58, No. 10, 2010, p. 5178-5185.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Matrix-lifting semidefinite programming for detection in multiple antenna systems

AU - Mobasher, A.

AU - Sotirov, R.

AU - Khandani, A.K.

PY - 2010

Y1 - 2010

N2 - This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting semi-definite programming (SDP). The strength of the proposed method lies in a new relaxation approach applied to the previous work by Mobasher This results in a reduction of the number of variables from (NK + 1)(NK + 2)/2, in the previous work by Mobasher to (2N +K)2 , in the new method, where N is twice the number of transmit antennas and K is the number of constellation points in each real dimension. It is shown that this reduction in the number of variables results in a significant computational complexity reduction compared to the previous work by Mobasher Moreover, the proposed method offers a better symbol error rate performance as compared to some known and recent SDP-based quasi-maximum likelihood detection methods reported in the literature.

AB - This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting semi-definite programming (SDP). The strength of the proposed method lies in a new relaxation approach applied to the previous work by Mobasher This results in a reduction of the number of variables from (NK + 1)(NK + 2)/2, in the previous work by Mobasher to (2N +K)2 , in the new method, where N is twice the number of transmit antennas and K is the number of constellation points in each real dimension. It is shown that this reduction in the number of variables results in a significant computational complexity reduction compared to the previous work by Mobasher Moreover, the proposed method offers a better symbol error rate performance as compared to some known and recent SDP-based quasi-maximum likelihood detection methods reported in the literature.

M3 - Article

VL - 58

SP - 5178

EP - 5185

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 10

ER -