Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: An Analysis of the Stationary Distribution and Mixing Time
暂无分享,去创建一个
Alexandros G. Dimakis | Weiyu Xu | Babak Hassibi | Haider Ali Jasim Alshamary | Morten Hansen | A. Dimakis | B. Hassibi | Weiyu Xu | Morten Hansen
[1] A. Sokal,et al. Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .
[2] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Hoon Kim,et al. Monte Carlo Statistical Methods , 2000, Technometrics.
[5] Rong Chen,et al. Convergence analyses and comparisons of Markov chain Monte Carlo algorithms in digital communications , 2002, IEEE Trans. Signal Process..
[6] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[7] Olle Häggström. Finite Markov Chains and Algorithmic Applications , 2002 .
[8] Stephan ten Brink,et al. Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..
[9] Giuseppe Caire,et al. On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.
[10] H. Vincent Poor,et al. Wireless Communication Systems: Advanced Techniques for Signal Reception , 2003 .
[11] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[12] Babak Hassibi,et al. On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.
[13] Babak Hassibi,et al. On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.
[14] Björn E. Ottersten,et al. On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.
[15] Haidong Zhu,et al. On performance of sphere decoding and Markov chain Monte Carlo detection methods , 2005, IEEE Signal Processing Letters.
[16] Haidong Zhu,et al. Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems , 2006, IEEE Transactions on Signal Processing.
[17] B. Sundar Rajan,et al. A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems , 2008, IEEE Journal on Selected Areas in Communications.
[18] Alexandros G. Dimakis,et al. Near-Optimal Detection in MIMO Systems Using Gibbs Sampling , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.
[19] B. Sundar Rajan,et al. Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems , 2010, IEEE Communications Letters.
[20] Anthony Man-Cho So,et al. Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[21] Mazen Al Borno,et al. Reduction in Solving Some Integer Least Squares Problems , 2011, ArXiv.
[22] Alexandros G. Dimakis,et al. On the mixing time of Markov Chain Monte Carlo for integer least-square problems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[23] V. Climenhaga. Markov chains and mixing times , 2013 .
[24] Erik G. Larsson,et al. Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..