By Topic

Channel-Adaptive MIMO Detection Based on the Multiple-Choice Knapsack Problem (MCKP)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
I-Wei Lai ; Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan ; Chia-Han Lee ; Ascheid, G. ; Tzi-Dar Chiueh

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.

Published in:

Wireless Communications Letters, IEEE  (Volume:1 ,  Issue: 6 )