On performance of sphere decoding and Markov chain Monte Carlo detection methods
暂无分享,去创建一个
Haidong Zhu | Rong-Rong Chen | Behrouz Farhang-Boroujeny | B. Farhang-Boroujeny | Haidong Zhu | Rong-Rong Chen
[1] H. Vincent Poor,et al. Iterative (turbo) soft interference cancellation and decoding for coded CDMA , 1999, IEEE Trans. Commun..
[2] Babak Hassibi,et al. Modified fincke-pohst algorithm for low-complexity iterative decoding over multiple antenna channels , 2002, Proceedings IEEE International Symposium on Information Theory,.
[3] Krishna R. Pattipati,et al. An improved complex sphere decoder for V-BLAST systems , 2004, IEEE Signal Processing Letters.
[4] Haidong Zhu,et al. Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems , 2006, IEEE Transactions on Signal Processing.
[5] Patrick Robertson,et al. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.
[6] Olle Häggström. Finite Markov Chains and Algorithmic Applications , 2002 .
[7] Stephan ten Brink,et al. Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..
[8] Hesham El Gamal,et al. A new approach to layered space-Time coding and signal processing , 2001, IEEE Trans. Inf. Theory.
[9] Babak Hassibi,et al. On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.
[10] Christian P. Robert,et al. Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.
[11] Zhenning Shi,et al. Markov chain Monte Carlo techniques in iterative detectors: a novel approach based on Monte Carlo integration , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..
[12] Krishna R. Pattipati,et al. Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound , 2004, IEEE Transactions on Communications.