MCMC methods for integer least-squares problems

We consider the problem of finding the least-squares solution to a system of linear equations where the unknown vector has integer entries (or, more precisely, has entries belonging to a subset of the integers), yet where the coefficient matrix and given vector are comprised of real numbers. Geometrically, this problem is equivalent to finding the closest lattice point to a given point and is known to be NP hard. In communication applications, however, the given vector is not arbitrary, but is a lattice point perturbed by some noise vector. Therefore it is of interest to study the computational complexity of various algorithms as a function of the noise variance or, often more appropriately, the SNR.

[1]  Behrouz Farhang-Boroujeny,et al.  Implementation of a Markov Chain Monte Carlo Based Multiuser/MIMO Detector , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Olle Häggström Finite Markov Chains and Algorithmic Applications , 2002 .

[3]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[4]  Alexandros G. Dimakis,et al.  Near-Optimal Detection in MIMO Systems Using Gibbs Sampling , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[5]  Haidong Zhu,et al.  Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems , 2006, IEEE Transactions on Signal Processing.

[6]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[7]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[8]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[9]  Rong Chen,et al.  Convergence analyses and comparisons of Markov chain Monte Carlo algorithms in digital communications , 2002, IEEE Trans. Signal Process..

[10]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[11]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[12]  H. Vincent Poor,et al.  Wireless Communication Systems: Advanced Techniques for Signal Reception , 2003 .

[13]  Haidong Zhu,et al.  On performance of sphere decoding and Markov chain Monte Carlo detection methods , 2005, IEEE Signal Processing Letters.

[14]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[15]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.