Channel-adaptive MIMO detection based on the multiple-choice knapsack problem (MCKP)

I. Wei Lai*, Chia-Han Lee, Gerd Ascheid, Tzi Dar Chiueh

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

The recently-proposed channel-adaptive multiple-input multiple-output (CA-MIMO) detection significantly reduces the average complexity of MIMO detection. Aiming at the just-acceptable error rate (JAER), the detection methods are switched according to the channel condition. In this letter, we formulate the switching of detection methods as a multiple-choice knapsack problem (MCKP). Then, based on the linear relaxation MCKP, the lower and upper bounds of the potential complexity saving of CA-MIMO are derived, where the former comes from our proposed switching strategy. The simulations show that the lower and upper bounds are tightly matched, demonstrating our two contributions: the evaluation of the optimal performance of the CA-MIMO detection without solving the NP-hard MCKP, and the design of an efficient and practical switching strategy.

原文English
文章編號6308769
頁(從 - 到)633-636
頁數4
期刊IEEE Wireless Communications Letters
1
發行號6
DOIs
出版狀態Published - 27 9月 2012

指紋

深入研究「Channel-adaptive MIMO detection based on the multiple-choice knapsack problem (MCKP)」主題。共同形成了獨特的指紋。

引用此