Mobile version of Hanspub

文章引用说明 更多>> (返回到该文章)

McGowan, J.A. and Williamson, R.C. (2003) Loop removal from LDPC codes. IEEE Information Theory Workshop, 230233.

被以下文章引用:

  • 标题: LDPC码校验矩阵回路的求解算法LDPC Code’s Girth Calculation Algorithm

    作者: 张焕明, 张宾

    关键字: LDPC码, , 回路 Low-Density Parity-Check Codes; Tree; Girth

    期刊名称: 《Hans Journal of Wireless Communications》, Vol.4 No.1, 2014-01-24

    摘要: 1996年LDPC(低密度奇偶校验,Low-Density Parity-Check)码是性能限与香农限仅差0.0045 dB的一种差错控制码[1],译码采用SPA(和积算法),但其性能受Tanner图中回路长度和回路数目的影响,回路的存在使译码信息重复迭代,性能下降[2]。本论文通过计算机仿真,采用Matlab元胞数组,将二元校验矩阵转换为树矩阵,实现了求解LDPC码回路的算法。Low-Density Parity-Check codes have advantageous performances discovered in 1996 with Shannon limit only 0.0045 dB. Decoding algorithm adopts SPA (Sum-Product Algorithm). However, girths in LDPC codes are detrimental to the code’s performance, and the existence of loops makes the decoding information iterative and the performance reduced. This paper, through computer simulation, using the Matlab cellular array, to convert the binary check matrix to tree matrix, realizes the algorithm of LDPC codes loop.