删余低密度奇偶校验码的分析与设计

王继康; 周荷琴

doi:10.3724/SP.J.1146.2006.00065

删余低密度奇偶校验码的分析与设计

doi: 10.3724/SP.J.1146.2006.00065

计量
- 文章访问数: 2989
- HTML全文浏览量: 53
- PDF下载量: 802
- 被引次数: 0
出版历程
- 收稿日期: 2006-01-13
- 修回日期: 2006-09-06
- 刊出日期: 2007-09-19

Analysis and Design of Punctured LDPC

摘要

摘要: 通信系统中在不同的信道条件下常采用不同的编码速率，删余码是实现这种策略的有效方式。该文基于高斯近似思想，分析了高斯白噪声信道上删余LDPC码的消息传递译码算法，并在推导出消息均值迭代公式的基础上提出了一种优化删余分布的方法。仿真结果表明，根据此优化方法设计的删余LDPC码在消息传递译码算法下，消息均值增长较快并且消息传递译码算法具有较快的收敛速度。
- 低密度奇偶校验码;高斯近似;删余
Abstract: 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 Gaussian 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.

HTML全文

参考文献(1)

Lin S and Yu P S. A hybrid ARQ scheme with parity retransmission for error control of satellite channels[J].IEEE Trans. on Comm.1982, 30(7):1701-1709[2]Hagenauer J. Rate-compatible punctured convolutional codes (RCPC codes) and their applications[J].IEEE Trans. on Comm.1988, 36(4):389-400[3]Barbulescu A S and Pietrobon S S. Rate compatible turbo codes[J].Electronics Letters.1995, 31(7):535-536[4]Rowitch 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.[5]Gallager R G. Low-density parity-check codes[J].IRE Trans. On Info. Theory.1962, 8(1):21-28[6]Chung 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.[7]Li 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.[8]Yazdani M and Banihashemi A. On construction of rate-compatible low-density parity-check codes[J].IEEE Comm. Letters.2004, 8(3):159-161[9]Dholakia A and Olcer S. Rate-compatible low-density parity-check codes for digital subscriber lines. IEEE ICC, Paris, France, 2004: 415-419.[10]Ha J and McLaughlin S W. Optimal puncturing of low-density parity-check codes. IEEE ICC, Alaska, USA, 2003: 3110-3114.Ha J and McLaughlin S W. Optimal puncturing distributions for rate-compatible low-density parity-check codes. IEEE ISIT, Yokohama, Japan, 2003: 233.[11]Ha J, Kim J, and McLaughlin S W. Rate-compatible of Low-density parity-check codes[J].IEEE Trans. on Info. Theory.2004, 50(11):2824-2836[12]Richardson T J and Urbanke R. The capacity of low-density parity-check codes under message-passing decoding[J].IEEE Trans. on Info. Theory.2001, 47(2):599-618[13]Chung S Y, Richardson T J, and Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Trans. on Info. Theory.2001, 47(2):657-670

施引文献

资源附件(0)

访问统计