arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.2867cs.ITmath.IT
收藏

两级选择平均LDPC译码

A Two Stage Selective Averaging LDPC Decoding

A. Dinesh Kumar, Ambedkar Dukkipati

摘要:

低密度奇偶校验(LDPC)码是一类线性分组码,通过在码的因子图上运行置信传播(BP)算法或对数似然比置信传播(LLR-BP)来译码。LDPC码的缺点之一是在高信噪比值时由捕获集引起的错误平层的开始。在本文中,我们提出了一个两阶段的解码器来处理不同类型的陷阱集。振荡陷印集由解码器的第一级处理,而基本陷印集由解码器的第二级处理。对常规PEG(504,252,3,6)码的仿真结果表明,该两级译码器的性能明显优于标准译码器。

英文摘要:

Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over the factor graph of the code. One of the disadvantages of LDPC codes is the onset of an error floor at high values of signal to noise ratio caused by trapping sets. In this paper, we propose a two stage decoder to deal with different types of trapping sets. Oscillating trapping sets are taken care by the first stage of the decoder and the elementary trapping sets are handled by the second stage of the decoder. Simulation results on regular PEG (504,252,3,6) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑