A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems


Autoria(s): Datta, Tanumay; Kumar, Ashok N; Chockalingam, A; Rajan, Sundar B
Data(s)

2012

Resumo

In this paper, we propose a low-complexity algorithm based on Markov chain Monte Carlo (MCMC) technique for signal detection on the uplink in large scale multiuser multiple input multiple output (MIMO) systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The algorithm employs a randomized sampling method (which makes a probabilistic choice between Gibbs sampling and random sampling in each iteration) for detection. The proposed algorithm alleviates the stalling problem encountered at high SNRs in conventional MCMC algorithm and achieves near-optimal performance in large systems with M-QAM. A novel ingredient in the algorithm that is responsible for achieving near-optimal performance at low complexities is the joint use of a randomized MCMC (R-MCMC) strategy coupled with a multiple restart strategy with an efficient restart criterion. Near-optimal detection performance is demonstrated for large number of BS antennas and users (e.g., 64, 128, 256 BS antennas/users).

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/48289/1/Info_The_Appl_Work_69_2012.pdf

Datta, Tanumay and Kumar, Ashok N and Chockalingam, A and Rajan, Sundar B (2012) A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems. In: 2012 Information Theory and Applications Workshop (ITA), 5-10 Feb. 2012, San Diego, CA.

Publicador

IEEE

Relação

http://dx.doi.org/10.1109/ITA.2012.6181816

http://eprints.iisc.ernet.in/48289/

Palavras-Chave #Electrical Communication Engineering
Tipo

Conference Paper

PeerReviewed