期刊文献+

AN IMPROVED MARKOV CHAIN MONTE CARLO METHOD FOR MIMO ITERATIVE DETECTION AND DECODING

AN IMPROVED MARKOV CHAIN MONTE CARLO METHOD FOR MIMO ITERATIVE DETECTION AND DECODING
下载PDF
导出
摘要 Recently, a new soft-in soft-out detection algorithm based on the Markov Chain Monte Carlo (MCMC) simulation technique for Multiple-Input Multiple-Output (MIMO) systems is proposed, which is shown to perform significantly better than their sphere decoding counterparts with relatively low complexity. However, the MCMC simulator is likely to get trapped in a fixed state when the channel SNR is high, thus lots of repetitive samples are observed and the accuracy of A Posteriori Probability (APP) estimation deteriorates. To solve this problem, an improved version of MCMC simulator, named forced-dispersed MCMC algorithm is proposed. Based on the a posteriori variance of each bit, the Gibbs sampler is monitored. Once the trapped state is detected, the sample is dispersed intentionally according to the a posteriori variance. Extensive simulation shows that, compared with the existing solution, the proposed algorithm enables the markov chain to travel more states, which ensures a near-optimal performance. Recently, a new soft-in soft-out detection algorithm based on the Markov Chain Monte Carlo (MCMC) simulation technique for Multiple-Input Multiple-Output (MIMO) systems is proposed, which is shown to perform significantly better than their sphere decoding counterparts with relatively low complexity. However, the MCMC simulator is likely to get trapped in a fixed state when the channel SNR is high, thus lots of repetitive samples are observed and the accuracy of A Posteriori Probability (APP) estimation deteriorates. To solve this problem, an improved version of MCMC simulator, named forced-dispersed MCMC algorithm is proposed. Based on the a posteriori variance of each bit, the Gibbs sampler is monitored. Once the trapped state is detected, the sample is dispersed intentionally according to the a posteriori variance. Extensive simulation shows that, compared with the existing solution, the proposed algorithm enables the markov chain to travel more states, which ensures a near-optimal performance.
出处 《Journal of Electronics(China)》 2008年第3期305-310,共6页 电子科学学刊(英文版)
关键词 马尔可夫链 解码技术 通信系统 探测方法 List Sphere Decoding (LSD) Gibbs sampler Markov Chain Monte Carlo (MCMC)
  • 相关文献

参考文献6

  • 1E. Telatar.Capacity of multi-antenna Gaussian channels[].European Trans on Telecommunication.1999
  • 2H. Vikalo,B. Hassibi,and T. Kailath.Iterative decoding for MIMO channels via modified sphere decoding[].IEEE Trans on Wireless Commun.2004
  • 3Behrouz Farhang-Boroujeny,Haidong (David) Zhu,and Zhenning Shi.Markov Chain Monte Carlo algorithms for CDMA and MIMO communication systems[].IEEE Trans on Signal Processing.2006
  • 4Haidong Zhu,Zhenning Shi,and Behrouz Farhang- Borujeny.MIMO detection using Markov chain Monte Carlotechniques for near-capacity performance[].Proc of the th International Conference on Acoustics Speech and Signal Processing (ICASSP’) March –.18–232005
  • 5Markus ADangl,Zhengning Shi,Mark C. Reed,and Jürgen Lindner.Advanced Markov chain Monte Carlo methods for iterative (turbo) multiuser detection[].Proc of the th Int Symposium on Turbo Codes & Related Topics April –.3–72006
  • 6Hochwald B M,Brink S T.Achieving near-capacity on a multiple-antenna channel[].IEEE Transon Commu.2003

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部