期刊文献+

删余低密度奇偶校验码的分析与设计 被引量:1

Analysis and Design of Punctured LDPC
下载PDF
导出
摘要 通信系统中在不同的信道条件下常采用不同的编码速率,删余码是实现这种策略的有效方式。该文基于高斯近似思想,分析了高斯白噪声信道上删余LDPC码的消息传递译码算法,并在推导出消息均值迭代公式的基础上提出了一种优化删余分布的方法。仿真结果表明,根据此优化方法设计的删余LDPC码在消息传递译码算法下,消息均值增长较快并且消息传递译码算法具有较快的收敛速度。 In Communication systems, code rates are usually adapted to different channel environment, while puncturing is an effective solution to this strategy. Based on Gaussian approximation, the message-passing decoding algorithm for punctured Low-Density Parity-Check (LDPC)codes on Additive White Ganssian Noise (AWGN) channel is analyzed, as well as the recursive function for message mean is derived. According to this function, a novel design approach is proposed for optimizing the puncturing distributions. Simulation results demonstrate that not only the message mean of message-passing decoder increases more quickly for punctured LDPC optimized by the proposed approach, but also the convergence rate of message-passing decoder is faster than that by traditional approaches.
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第9期2149-2153,共5页 Journal of Electronics & Information Technology
关键词 低密度奇偶校验码 高斯近似 删余 Low-Density Parity-Check (LDPC) code Ganssian approximation Puncturing
  • 相关文献

参考文献14

  • 1Lin S and Yu P S.A hybrid ARQ scheme with parity retransmission for error control of satellite channels.IEEE Trans.on Comm.,1982,30(7):1701-1709.
  • 2Hagenauer J.Rate-compatible punctured convolutional codes (RCPC codes) and their applications.IEEE Trans.on Comm.,1988,36(4):389-400.
  • 3Barbulescu A S and Pietrobon S S.Rate compatible turbo codes.Electronics Letters,1995,31(7):535-536.
  • 4Rowitch D N and Milstein L B.Rate compatible punctured turbo (RCPT) codes in a hybrid FER/ARQ system.IEEE GLOBECOM,Rio de Janeiro,BR,1999:2341-2345.
  • 5Gallager R G.Low-density parity-check codes.IRE Trans.On Info.Theory,1962,8(1):21-28.
  • 6Chung S Y,Forney G D,and Richardson T J,et al..On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit.IEEE Comm.Letters,2001,5(2):58-60.
  • 7Li J and Narayanan K.Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications.IEEE CIIT,US Virgin Islands,2002:201-206.
  • 8Yazdani M and Banihashemi A.On construction of rate-compatible low-density parity-check codes.IEEE Comm.Letters,2004,8(3):159-161.
  • 9Dholakia A and Olcer S.Rate-compatible low-density parity-check codes for digital subscriber lines.IEEE ICC,Paris,France,2004:415-419.
  • 10Ha J and McLaughlin S W.Optimal puncturing of low-density parity-check codes.IEEE ICC,Alaska,USA,2003:3110-3114.

同被引文献13

  • 1HAGENAUER J. Rate - compatible punctured convolutional codes(RCPC codes) and their applications [ J]. IEEE Trans. on Communications, 1988,36(4) : 389 -400.
  • 2LI J, NARAYANA K. Rate - compatible low density parity check codes for capacity approaching ARQ scheme in packet data communications [ C ]//IEEE CIIT, US Virgin Islands, 2002 : 201 - 206.
  • 3ROWITCH N, MILSTEIN L B. On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes[J]. IEEE Trans. on Communications, 2000, 48 (6) : 948 - 959.
  • 4Z. L, L. CHEN. Efficient Encoding of Quasi - Cyclic Low - Density Parity - Check Codes [ C ]//IEEE Trans. Communica- tions, IS. 1.] : [s.n.], 2006, 54(2):71 -81.
  • 5JUN X, LEI C. Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking [ J ]. IEEE Trans. Information Theory, 2007, 53 (3) : 121 - 134.
  • 6LING Q z , LAN L. Construction of Nonbinary Cyclic, Quasi - Cyclic and Regular LDPC Codes: A Finite Geometry Approach [C]//IEEE Trans. Communications, [S. 1.]:[s. n.], 2008,56:378 - 387.
  • 7VASIC B, MILENKOVIC O. Combinatorial Constructions of Low -Density Parity - Check Codes for Iterative Decoding [ J ]. IEEE Trans. Information Theory,2004,50(6) :1156 -1176.
  • 8RICHARDSON T, URBANKE R. The capacity of low - density Parity - check codes under message - passing Decoding [ J ]. IEEE Transactions on information Theory, 2001 ( 2 ) : 599 - 618.
  • 9YAZDANI M, BANILHASHWMI A. On construction of rate - compatible low - density parity - check codes [ C ]//IEEE Comm. Letters, [ S. 1. ]: [ s. n. ], 2004,8 (3): 159 - 161.
  • 10TANNER R M. a recursive approach to Low Complexity Codes [J]. IEEE Transactions On information Theory, 1981,27:533 - 547.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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