Rice信道下LDPC码密度进化的研究

徐华; 徐澄圻

Rice信道下LDPC码密度进化的研究

徐华,
徐澄圻

计量
- 文章访问数: 2300
- HTML全文浏览量: 114
- PDF下载量: 998
- 被引次数: 0
出版历程
- 收稿日期: 2005-03-21
- 修回日期: 2005-09-12
- 刊出日期: 2006-10-19

Research of Density Evolution of LDPC Codes over Rice Channels

Xu Hua,
Xu Cheng-qi

摘要

摘要: 应用低密度奇偶校验(LDPC)码译码消息的密度进化可以得到码集的噪声门限，依此评价不同译码算法的性能，并可以用来优化非正则LDPC码的次数分布对。该文首先以Rice信道下正则LDPC码为例，讨论了不同量化阶数及步长时BP，BP-based 和offset BP-based 3种译码算法的DDE(Discrete Density Evolution)分析，接着在offset BP-based译码算法的DDE分析基础上，采用差分进化方法对Rice信道下非正则LDPC码的次数分布对进行了优化，得出了相应的噪声门限。最后，给出了Rice信道下码率为1/2的优化非正则LDPC码的概率聚集函数(PMF)进化曲线。
- LDPC码; Rice信道; 先验密度; Offset BP-based译码算法; 离散密度进化
Abstract: Noise threshold of Low Density Parity Check (LDPC) codes ensemble could be calculated by density evolution of the decoding messages. According to the threshold, performance of the decoding algorithm could be evaluated and degree distribution pairs of irregular LDPC codes also might be optimized. In this paper, for regular LDPC codes on Rice channel, Discrete Density Evolution(DDE) for BP,BP-based and offset BP-based decoding algorithm were compared on different quantization level and step. Furthermore, degree distribution pairs of the irregular LDPC codes were optimized on Rice channel, which was based on DDE for offset BP-based decoding algorithm, the corresponding threshold is also calculated. Finally, the Probability Mass Function (PMF) evolution curve of optimized irregular LDPC codes with code rate 1/2 on Rice channel is given.

HTML全文

参考文献(1)

Gallager R G. Low-density parity-check codes[J].IRE Trans. on Info. Theory.1962, 8(1):21-28[2]Richardson T J, Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding [J].IEEE Trans. on Info. Theory.2001, 47(2):599-618[3]Mackay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans.on Info. Theory.1999, 45(3):399-431[4]Fossorier M, Mihaljevic M, Imai H. Reduced complexity iterative decoding of low density parity check codes based on belief propagation[J].IEEE Trans. on Communications.1999, 47(5):673-680[5]Wei X, Akansu A N. Density evolution for low density parity check coeds under Max-Log-MAP decoding[J].Electronics Letters.2001, 37(18):1125-1126[6]贺玉成, 杨莉, 王新梅, et al.. 置信传播算法的性能测度[J].电子学报, 2002, 30(4): 577-580.[7]Chung S Y, Forney J G D, Richardson T J, et al.. On the design of low-density parity-check codes within 00045dB of the Shannon limit[J].. IEEE Communications. Letters.2001, 5(2):58-60[8]Chen J H, Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Communications Letters.2002, 6(5):208-210[9]Chen J H, Fossorier M. Density evolution for BP-based decoding algorithm of LDPC codes and their quantized versions[C]. IEEE Global Telecommunications Conference, Taipei, Nov. 2002, 2: 1378-1382.[10]Hou J L, Siegel P H, Milstein B. Perforance analysis and optimaization of low density parity check codes on Rayleigh channels[J].IEEE J. on Selected Area in Communication.2001, 19(5):924-934[11]林家儒, 吴伟陵. LDPC码在RICE信道中的性能分析[J]. 北京: 北京邮电大学学报, 2004, 27(2): 48-53.[12]Shokrollahi A, Storn R. Design of efficient erasure codes with differential evolution[C]. In Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000: 5.[13]Storn R, Price K. Differential evolutionA simple and efficient heuristic adaptive scheme for global optimization over continuous spaces[J].J. Global Optimization.1997, 11(2):341-359[14]Chung S Y, Richardson T J, Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a gaussaian approximation[J].IEEE Trans. on Info. Theory.2001, 47(2):657-670[15]Kavcic A, Ma X, Mitzenmacher M. Binary intersymbol Interference channels: Gallager codes, density evolution, and code perfornance bounds[J].IEEE Trans. on Info. Theory.2003, 49(7):1636-1652[16]Tan W J, Cruz J R. Performance evaluation of low-density parity-check codes on partial-response channels using density evolution[J].IEEE Trans. on Communications.2004, 52(8):1253-1256

施引文献

资源附件(0)

访问统计