空间耦合LDPC码的分层译码算法

A Layered Decoding Algorithm for Spatially-coupled LDPC Codes

针对长码长空间耦合低密度奇偶校验(SC-LDPC)码译码时延较长的问题,该文提出了分层滑动窗译码(LSWD)算法。该算法利用SC-LDPC子码码块的准循环特性和滑动窗内校验矩阵的层次结构,通过在滑动窗内对校验矩阵进行分层处理,优化层与层之间消息传递,从而加快窗内译码的收敛速度,减少了译码迭代次数。仿真和分析结果表明:在相同的信噪比(SNR)条件和相同的误码性能要求下,LSWD算法所需的迭代次数少于滑动窗译码(SWD)算法,特别在高信噪比下,LSWD算法的迭代次数约为SWD算法的一半,从而有效缩短全局译码时延;在相同译码迭代次数下,LSWD算法的译码性能优于SWD算法,而其计算复杂度增加不大。

In order to solve the problem of the long decoding delay for the Spatially-Coupled Low-Density Parity-Check(SC-LDPC)code with long code length,a Layered Sliding Window Decoding(LSWD)algorithm is proposed.By exploring the quasi-cyclic characteristics of the SC-LDPC sub-codeblock and the hierarchical structure of the check matrix in the sliding window,the part of check matrix in the sliding window is layered to optimize the message transfer between two neighbor layers,with the aim of accelerating the convergence of the iterative procedure and reducing the number of decoding iterations.Simulation and analysis results show that the number of iterations in the proposed LSWD algorithm is less than that in the SWD,under the same Signalto-Noise Ratio(SNR)and the bit error ratio.In the high SNR region,especially,the number of iterations in the proposed LSWD is about half of that in the SWD,hence the global decoding delay of the former is effectively shorten.In addition,the decoding performance of the LSWD algorithm is better than the SWD algorithm under the same number of decoding iterations,and the overall computational complexity is slightly increased.