Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: An Analysis of the Stationary Distribution and Mixing Time

DOI10.1109/TSP.2014.2334558MaRDI QIDQ4579409zbMATH OpenOpenAlexFDO

Authors Morten H. Hansen, Alexandros G. Dimakis, Haider Ali Jasim Alshamary, Weiyu Xu, B. Hassibi

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.7305

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)

Abstract: In this paper we introduce an optimized Markov Chain Monte Carlo (MCMC) technique for solving the integer least-squares (ILS) problems, which include Maximum Likelihood (ML) detection in Multiple-Input Multiple-Output (MIMO) systems. Two factors contribute to the speed of finding the optimal solution by the MCMC detector: the probability of the optimal solution in the stationary distribution, and the mixing time of the MCMC detector. Firstly, we compute the optimal value of the "temperature" parameter, in the sense that the temperature has the desirable property that once the Markov chain has mixed to its stationary distribution, there is polynomially small probability ($1/mboxpoly(N)$, instead of exponentially small) of encountering the optimal solution. This temperature is shown to be at most $O(sqrtSNR/ln(N))$, where $SNR$ is the signal-to-noise ratio, and $N$ is the problem dimension. Secondly, we study the mixing time of the underlying Markov chain of the proposed MCMC detector. We find that, the mixing time of MCMC is closely related to whether there is a local minimum in the lattice structures of ILS problems. For some lattices without local minima, the mixing time of the Markov chain is independent of $SNR$, and grows polynomially in the problem dimension; for lattices with local minima, the mixing time grows unboundedly as $SNR$ grows, when the temperature is set, as in conventional wisdom, to be the standard deviation of noises. Our results suggest that, to ensure fast mixing for a fixed dimension $N$, the temperature for MCMC should instead be set as $Omega(sqrtSNR)$ in general. Simulation results show that the optimized MCMC detector efficiently achieves approximately ML detection in MIMO systems having a huge number of transmit and receive dimensions.

Recommendations

• Stochastic MIMO Detector Based on the Markov Chain Monte Carlo Algorithm
• Markov Chain Monte Carlo Detectors for Channels With Intersymbol Interference
• Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems
• A low-complexity sequential Monte Carlo algorithm for blind detection in MIMO systems
• Monte Carlo Bayesian signal processing for wireless communications
• An Enhanced Deterministic Sequential Monte Carlo Method for Near-Optimal MIMO Demodulation With QAM Constellations
• Sequential Monte Carlo methods for complexity-constrained MAP equalization of dispersive MIMO channels
• Markov chain Monte Carlo methods with applications to signal processing.
• Nonparametric adaptive detection in fading channels based on sequential Monte Carlo and Bayesian model averaging

Cited in

(4)

• Mixed \(H_{2}/H_{\infty}\) control of Markovian jump time-delay systems with uncertain transition probabilities
• Markov chain Monte Carlo methods with applications to signal processing.
• An Enhanced Deterministic Sequential Monte Carlo Method for Near-Optimal MIMO Demodulation With QAM Constellations
• Intermittent control to stationary distribution and exponential stability for hybrid multi-stochastic-weight coupled networks based on aperiodicity

This page was built for publication: Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: An Analysis of the Stationary Distribution and Mixing Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579409)