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

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

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/6181816/

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

Abstract

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).

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Keywords:Multiple Restarts; Large-scale Multiuser MIMO; Markov Chain Monte Carlo Technique; Gibbs Sampling; Detection; Stalling Problem; Randomized Sampling
ID Code:102214
Deposited On:26 Mar 2017 16:25
Last Modified:26 Mar 2017 16:25

Repository Staff Only: item control page