DocumentCode
1154905
Title
Reduced-Complexity Iterative Markov Chain MBER Detection for MIMO Systems
Author
Sugiura, Shinya ; Chen, Sheng ; Hanzo, Lajos
Author_Institution
Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton
Volume
16
Issue
3
fYear
2009
fDate
3/1/2009 12:00:00 AM
Firstpage
160
Lastpage
163
Abstract
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.
Keywords
MIMO systems; Markov processes; computational complexity; error statistics; iterative methods; multiuser detection; quadrature amplitude modulation; space division multiple access; space division multiplexing; BER; M-QAM; MIMO systems; Markov chain process; SDM/SDMA uplink system; computational complexity; minimum bit error rate detection method; multiuser detection; reduced-complexity iterative Markov chain MBER detection; Bit error rate; Computational complexity; Detectors; Interference cancellation; Iterative decoding; MIMO; Monte Carlo methods; Multiaccess communication; Multiuser detection; Transmitting antennas; Markov chain Monte Carlo; minimum bit error rate; multiuser detection; soft interference cancellation;
fLanguage
English
Journal_Title
Signal Processing Letters, IEEE
Publisher
ieee
ISSN
1070-9908
Type
jour
DOI
10.1109/LSP.2008.2010817
Filename
4781942
Link To Document