By Topic

Reduced-Complexity Iterative Markov Chain MBER Detection for MIMO Systems

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
$33 $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

3 Author(s)
Shinya Sugiura ; Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton ; Sheng Chen ; Lajos Hanzo

A novel Markov chain (MC) representation aided minimum bit error rate (MBER) detection method is proposed for an M-QAM modulated SDM/SDMA uplink system. Compared to the conventional MBER scheme, the proposed MC-MBER scheme is capable of reducing the complexity imposed with the aid of its efficient detection candidate set generation assisted by the Markov chain process. Our performance results demonstrate that the MC-MBER multiuser detection (MUD) is capable of reducing the computational complexity by a factor of eight in comparison to the conventional MBER MUD in a rank-deficient system transmitting four 4-QAM substreams with the aid of two receive antennas, while achieving a BER performance comparable to that of the MBER MUD.

Published in:

IEEE Signal Processing Letters  (Volume:16 ,  Issue: 3 )