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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Article number6308769
Pages (from-to)633-636
Number of pages4
JournalIEEE Wireless Communications Letters
Issue number6
StatePublished - 27 Sep 2012


  • MIMO detection
  • channel-adaptive MIMO detection (CA-MIMO)
  • multiple-choice knapsack problem (MCKP)
  • sphere decoder (SD)

Fingerprint Dive into the research topics of 'Channel-adaptive MIMO detection based on the multiple-choice knapsack problem (MCKP)'. Together they form a unique fingerprint.

Cite this