A novel branch-and-bound based maximum-likelihood MIMO detection algorithm

研究成果: Conference contribution

摘要

For a multiple-input multiple output (MIMO) communication system, the optimal detection is by the maximum-likelihood (ML) approach, which, however, has complexity that increases exponentially with the number of transmit antennas. In this paper, we propose a novel algorithm that implements the MIMO ML detection with reduced complexity. Our algorithm is developed based on a branch-and-bound (BB) principle. We apply a new type of cost function and give an efficient calculation algorithm. The initial reference data vector could be obtained by efficient MMSE-based algorithms. We also observe the impacts of initial reference data vectors.

原文English
主出版物標題2008 IEEE Radio and Wireless Symposium, RWS
頁面627-630
頁數4
DOIs
出版狀態Published - 2008 九月 9
事件2008 IEEE Radio and Wireless Symposium, RWS - Orlando, FL, United States
持續時間: 2008 一月 222008 一月 24

出版系列

名字2008 IEEE Radio and Wireless Symposium, RWS

Other

Other2008 IEEE Radio and Wireless Symposium, RWS
國家United States
城市Orlando, FL
期間08-01-2208-01-24

指紋

Maximum likelihood
communication system
Cost functions
Communication systems
Antennas
costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

引用此文

Chang, M-X. (2008). A novel branch-and-bound based maximum-likelihood MIMO detection algorithm. 於 2008 IEEE Radio and Wireless Symposium, RWS (頁 627-630). [4463570] (2008 IEEE Radio and Wireless Symposium, RWS). https://doi.org/10.1109/RWS.2008.4463570
Chang, Ming-Xian. / A novel branch-and-bound based maximum-likelihood MIMO detection algorithm. 2008 IEEE Radio and Wireless Symposium, RWS. 2008. 頁 627-630 (2008 IEEE Radio and Wireless Symposium, RWS).
@inproceedings{2dbdaece874847e28fd59bbe85910d7d,
title = "A novel branch-and-bound based maximum-likelihood MIMO detection algorithm",
abstract = "For a multiple-input multiple output (MIMO) communication system, the optimal detection is by the maximum-likelihood (ML) approach, which, however, has complexity that increases exponentially with the number of transmit antennas. In this paper, we propose a novel algorithm that implements the MIMO ML detection with reduced complexity. Our algorithm is developed based on a branch-and-bound (BB) principle. We apply a new type of cost function and give an efficient calculation algorithm. The initial reference data vector could be obtained by efficient MMSE-based algorithms. We also observe the impacts of initial reference data vectors.",
author = "Ming-Xian Chang",
year = "2008",
month = "9",
day = "9",
doi = "10.1109/RWS.2008.4463570",
language = "English",
isbn = "1424414636",
series = "2008 IEEE Radio and Wireless Symposium, RWS",
pages = "627--630",
booktitle = "2008 IEEE Radio and Wireless Symposium, RWS",

}

Chang, M-X 2008, A novel branch-and-bound based maximum-likelihood MIMO detection algorithm. 於 2008 IEEE Radio and Wireless Symposium, RWS., 4463570, 2008 IEEE Radio and Wireless Symposium, RWS, 頁 627-630, 2008 IEEE Radio and Wireless Symposium, RWS, Orlando, FL, United States, 08-01-22. https://doi.org/10.1109/RWS.2008.4463570

A novel branch-and-bound based maximum-likelihood MIMO detection algorithm. / Chang, Ming-Xian.

2008 IEEE Radio and Wireless Symposium, RWS. 2008. p. 627-630 4463570 (2008 IEEE Radio and Wireless Symposium, RWS).

研究成果: Conference contribution

TY - GEN

T1 - A novel branch-and-bound based maximum-likelihood MIMO detection algorithm

AU - Chang, Ming-Xian

PY - 2008/9/9

Y1 - 2008/9/9

N2 - For a multiple-input multiple output (MIMO) communication system, the optimal detection is by the maximum-likelihood (ML) approach, which, however, has complexity that increases exponentially with the number of transmit antennas. In this paper, we propose a novel algorithm that implements the MIMO ML detection with reduced complexity. Our algorithm is developed based on a branch-and-bound (BB) principle. We apply a new type of cost function and give an efficient calculation algorithm. The initial reference data vector could be obtained by efficient MMSE-based algorithms. We also observe the impacts of initial reference data vectors.

AB - For a multiple-input multiple output (MIMO) communication system, the optimal detection is by the maximum-likelihood (ML) approach, which, however, has complexity that increases exponentially with the number of transmit antennas. In this paper, we propose a novel algorithm that implements the MIMO ML detection with reduced complexity. Our algorithm is developed based on a branch-and-bound (BB) principle. We apply a new type of cost function and give an efficient calculation algorithm. The initial reference data vector could be obtained by efficient MMSE-based algorithms. We also observe the impacts of initial reference data vectors.

UR - http://www.scopus.com/inward/record.url?scp=50949131265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50949131265&partnerID=8YFLogxK

U2 - 10.1109/RWS.2008.4463570

DO - 10.1109/RWS.2008.4463570

M3 - Conference contribution

AN - SCOPUS:50949131265

SN - 1424414636

SN - 9781424414635

T3 - 2008 IEEE Radio and Wireless Symposium, RWS

SP - 627

EP - 630

BT - 2008 IEEE Radio and Wireless Symposium, RWS

ER -

Chang M-X. A novel branch-and-bound based maximum-likelihood MIMO detection algorithm. 於 2008 IEEE Radio and Wireless Symposium, RWS. 2008. p. 627-630. 4463570. (2008 IEEE Radio and Wireless Symposium, RWS). https://doi.org/10.1109/RWS.2008.4463570