TY - JOUR
T1 - Channel-adaptive MIMO detection based on the multiple-choice knapsack problem (MCKP)
AU - Lai, I. Wei
AU - Lee, Chia Han
AU - Ascheid, Gerd
AU - Chiueh, Tzi Dar
N1 - Funding Information:
Manuscript received July 11, 2012. The associate editor coordinating the review of this letter and approving it for publication was M. Tao. I-W. Lai and C.-H. Lee are with the Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan (e-mail: {iweilai, chiahan}@citi.sinica.edu.tw). G. Ascheid is with the Institute for Communication Technologies and Embedded Systems (ICE), RWTH Aachen University, Aachen, Germany. T.-D. Chiueh is with the National Chip Implementation Center and the Dept. of Electrical Engineering, National Taiwan University, Taiwan. This work was supported in part by the National Science Council, Taiwan, through grants NSC101-2219-E-001-001 and NSC101-2219-E-002-011. Digital Object Identifier 10.1109/WCL.2012.091312.120513
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - MIMO detection
KW - channel-adaptive MIMO detection (CA-MIMO)
KW - multiple-choice knapsack problem (MCKP)
KW - sphere decoder (SD)
UR - https://www.scopus.com/pages/publications/84871081326
UR - https://www.scopus.com/pages/publications/84871081326#tab=citedBy
U2 - 10.1109/WCL.2012.091312.120513
DO - 10.1109/WCL.2012.091312.120513
M3 - Article
AN - SCOPUS:84871081326
SN - 2162-2337
VL - 1
SP - 633
EP - 636
JO - IEEE Wireless Communications Letters
JF - IEEE Wireless Communications Letters
IS - 6
M1 - 6308769
ER -