期刊文献+

低密度校验码在瑞利衰落信道中的性能分析 被引量:13

Performance of Low-Density Parity-Check Codes over Rayleigh Fading Channels
下载PDF
导出
摘要 低密度校验 (L DPC)码具有编码增益高、译码速度快、可并行译码等特点 ,是当前编码界的一个研究热点 ,但是目前已有的研究成果都集中在高斯信道上 .该文分析和讨论了 L DPC码在瑞利衰落信道下的性能 ,应用联合界技术推导了一个规则码的性能限 ,并给出了仿真结果 ,且发现 L DPC码在瑞利衰落信道下也具有非常好的性能 . This paper investigates the performance and design of Low-density parity-check (LDPC) codes with coherent BPSK signaling on the Rayleigh fading channel. First, the fully interleaved case is considered in both situations of perfect channel state information (CSI) and non-channel state information (NCSI). LDPC codes perform well in the CSI channels, and when decoded with the average fading amplitude as an estimate of the NCSI channel, LDPC codes are not degraded too much compared to the CSI channel. Second, the correlated fading channel is considered. We find that LDPC codes are not severely sensitive to the fading speed of correlated channels and in this sense LDPC codes outperform turbo codes. In the simulation, for a BER of 10 -4 , LDPC codes offer coding gains of 2.2 dB at fading speed BT s =0.01 and 8.2 dB at fading speed BT s =0.001 compared to turbo codes, where the code rate R=1/3 and blocklength N=1260 . Finally, we present and demonstrate an upper bound of performance of regular LDPC codes by using the union bound technique in combination with the weight spectrum function of regular codes. The bound results give indications of achievable performance as well as the effects of block length and channels. From our results, we believe that LDPC codes are powerful in Rayleigh fading channels and might be potential candidates for the mobile communication systems.
出处 《计算机学报》 EI CSCD 北大核心 2002年第10期1077-1082,共6页 Chinese Journal of Computers
基金 国家自然科学基金 ( 6 9972 0 35 ) 华为科技基金 陕西省自然基金资助
关键词 低密度校验码 瑞利衰落信道 性能分析 规则码 非规则码 计算机仿真 信道编码 通信 LDPC, Rayleigh fading channel, regular code, irregular code
  • 相关文献

参考文献13

  • 1[1]Gallager R G. Low density parity check codes. IEE Trans Information Theory, 1962, 8(3): 208-220
  • 2[2]Berrou C, Blavieux A, Thitimajshima P. Near shammon limit error-correcting coding and decoding: Turbo-codes. In: Proc IEEE International Conference on Communications, Geneva, Switzerland, 1993. 1064-1070
  • 3[3]MacKay D J, Neal R M. Near shannon limit performance of low-density parity check codes. Electronic Letters, 1996,32(8): 1645-1646
  • 4[4]MacKay D J. Good error correcting codes based on very sparse matrices. IEEE Trans Information Theory, 1999, 45(2): 399-431
  • 5[5]Tanner R M. A recursive approach to low complexity codes. IEEE Trans Information Theory, 1981, 27(9): 533-547
  • 6[6]Richardson T, Urbanke R. The capacity of low-density parity-Check codes under message-passing decoding. IEEE Trans Information Theory, 2001,47(2): 478-496
  • 7[7]Rappaport T S. Wireless Communications: Principles and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1996
  • 8[8]Gagon F, Haccoun D. Bounds of the error performance of coding for nonindependent Rician-fading channels. IEEE Trans Communication, 1992, 40(2): 351-360
  • 9[9]Shamai S, Kaplan G. Achievable performance over the correlated Rician channel. IEEE Trans Communication, 1994, 42(11): 2967-2978
  • 10[10]Richardson T, Shodrollahi M A, Urbanke R. Design of Provably Good Low-Density Parity Check Codes. available at http://cm.bell-labs.com/cm/ms/former/tjr/pub.html

同被引文献55

引证文献13

二级引证文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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