Low-Complexity Joint Channel Estimation and LDPC Decoding for Block Fading Channel
暂无分享,去创建一个
[1] Ajay Dholakia,et al. Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.
[2] James A. Ritcey,et al. A factor graph approach to iterative channel estimation and LDPC decoding over fading channels , 2005, IEEE Transactions on Wireless Communications.
[3] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[4] Achilleas Anastasopoulos,et al. A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[5] Jinghu Chen,et al. Reduced complexity decoding algorithms for low-density parity check codes and turbo codes , 2003 .
[6] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[7] Andrew W. Eckford,et al. Analysis of Joint Channel Estimation and LDPC Decoding on Block Fading Channels , 2004 .
[8] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[9] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[10] Wayne E. Stark,et al. Unified design of iterative receivers using factor graphs , 2001, IEEE Trans. Inf. Theory.
[11] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .