基于密度进化算法的正则LDPC码噪声门限

  • 尹晓琦
展开
尹晓琦(1975-),女,江苏淮安人,淮阴工学院副教授,主要从事无线通信与信号处理研究. E-mail:kittyyin@hyit.edu.cn

收稿日期: 2015-06-12

  网络出版日期: 2016-05-25

基金资助

国家星火科技计划项目(2012GA690304);淮安市科技支撑计划项目(HAS2012046)

Thresholds of regular LDPC codes based on density evolution algorithm

  • YIN Xiaoqi
Expand
  • Faculty of Electronic Information Engineering, Huaiyin Institute of Technology, Huai’an 223003, China

Received date: 2015-06-12

  Online published: 2016-05-25

摘要

针对LDPC码(低密度奇偶校验码)的噪声门限问题,基于置信传播算法讨论密度进化算法的实现方法,通过对校验节点均值迭代公式的简化来确定门限值,简化算法降低了迭代运算的复杂度,减小了运算量.构造了3种不同次数分布的LDPC码,对其在高斯白噪声信道下噪声方差门限和信噪比门限进行了理论计算和仿真,并对结果进行了比较分析.研究结果表明,随着列重的增加,LDPC码的误码性能将变差,选择好的次数分布能获得优秀的误码性能,这对LDPC码进一步的应用研究具有指导意义.

本文引用格式

尹晓琦 . 基于密度进化算法的正则LDPC码噪声门限[J]. 河北大学学报(自然科学版), 2016 , 36(3) : 332 -336 . DOI: 10.3969/j.issn.1000-1565.2016.03.018

Abstract

To deal with the noise thresholds of LDPC codes,the density evolutionary algorithm based on belief propagation algorithm is discussed to determine the thresholds through simplifying the message iterative arithmetic on the means of the check nodes which can reduce the computing complexity and the amount of computation.Three different degree distribution LDPC codes have been constructed,and the theoretical calculation and simulation have been carried on to determine the noise variance thresholds and the SNR thresholds under AWGN channel,the results have been compared.It shows that with the increase of the column weight,the performance of LDPC codes becomes worse.Excellent performance can be obtained if we choose good numbers of degree distribution,that has guiding significance for further application research of LDPC codes.

参考文献

[1] MCKAY D J C.Good error-correcting codes based on very sparse matrices[J].IEEE Trans Inform Theory,1999,45(3):399-431.DOI:10.1109/18.748992.
[2] 王兰勋,王贵贵,尹超,等.基于HMM信源估计和LDPC的联合信源信道译码[J].河北大学学报(自然科学版),2008,28(2):209-213. WANG Lanxun,WANG Guigui,YIN Chao,et al.Joint source-channel decoding based on HMM and LDPC[J].Journal of Hebei University(Natural Science Edition),2008,28(2):209-213.
[3] GALLAGER R G.Low-density parity-check codes[D].Cambridge,MA:MIT Press,1963.DOI:10.1109/TIT.1962.1057683.
[4] RICHARDSON T J,URBANKE R.The capacity of low-density parity check codes under message passing decoding[J].IEEE Trans Inform Theory,2001,47(2):599-618.DOI:10.1109/18.910577.
[5] DUPRAZ ELSA,SAVIN V,KIEFFER M,et al.Density evolution for the design of non-binary low density parity check codes for Slepian-Wolf coding[J].IEEE Transactions on Communications,2015,63(1):25-36.DOI:10.1109/TCOMM.2014.2382126.
[6] 陈紫强,欧阳缮,肖海林,等.半双工中继信道下联合LDPC码设计[J].通信学报,2013,34(3):134-140.DOI:10.3969/j.issn.1000-436x.2013.03.017. CHEN Ziqiang,OUYANG Shan,XIAO Hailin,et al.Jointed LDPC codes design for half-duplex relay channels[J].Journal on Communications,2013,34(3):134-140.DOI:10.3969/j.issn.1000-436x.2013.03.017.
[7] TANNER R M,SRIDHARA D,SRIDHARAN A,et al.LDPC block and convolutional codes based on circulant matrices[J].IEEE Transactions on Information Theory,2004,50(12):2966-2984.DOI:10.1109/TIT.2004.838370.
[8] PEARL J.Probabilistic reasoning in intelligent systems:networks of plausible inference[M].San Francisco,CA,USA:Morgan Kaufmann Publishers Inc,1988:552.
[9] CHUNG S Y,RICHARDSON T J,URBANKE R.Analysis of sum-product decoding of low-density parity-check codes using a gaussian approximation[J].IEEE Transactions on Information Theory,2001,47(2):657-670.DOI:10.1109/18.910580.
文章导航

/

〈 〉