论文标题
NB QC-LDPC块代码的优化及其性能分析
Optimization of NB QC-LDPC Block Codes and Their Performance Analysis
论文作者
论文摘要
我们提出了一种优化非二进制（NB）准循环（QC）LDPC代码的方法。这种方法通过模拟退火和标记旨在最大化NB LDPC代码Tanner图的所谓的广义围绕所获得的基本矩阵来结合基础平价检查矩阵的构造。基于平均二进制光谱的拧紧随机编码边界，用于在二进制Galois场的扩展上的“几乎规则” NB LDPC代码有限长度的合奏。给出了“几乎常规” NB QC-LDPC块代码的总和BP解码的模拟FER性能，并将其与5G标准中优化的QC-LDPC块代码的派生有限长度随机编码边界以及相同的性能进行了比较。在瀑布区域中，我们在ML解码的误差概率上的有限长度边界距离BP解码的模拟FER性能约为0.1--0.2 dB。
We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the so-called generalized girth of the NB LDPC code Tanner graph. Tightened random coding bounds based on the average binary spectra for ensembles of "almost regular" NB LDPC codes of finite lengths over extensions of the binary Galois field are derived. The simulated FER performance of the sum-product BP decoding of "almost regular" NB QC-LDPC block codes are presented and compared with the derived finite-length random coding bounds as well as with the same performance of the optimized binary QC-LDPC block code in the 5G standard. In the waterfall region our finite-length bounds on the error probability of ML decoding are about 0.1--0.2 dB away from the simulated FER performance of BP decoding.
