Nonbinary LDPC cycle codes:efficient search,design,and code optimization
Nonbinary LDPC cycle codes:efficient search,design,and code optimization
复制标题
非二进制 LDPC 循环码：高效搜索、设计和代码优化
DOI：
10.1007/s11432-017-9271-6
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Zhang Bo
中科院分区：
文献类型：
--
作者：
Xu Hengzhou;Chen Chao;Zhu Min;Bai Baoming;Zhang Bo
非二进制低密度奇偶校验（NBLDPC）码在采用概率译码算法迭代译码时具有逼近容量的能力。随着有限域长度q的增加，GF（q）上的NBLDPC码在迭代译码下具有更好的性能。当q足够大时，增加q并没有显著的性能改善，而且最佳码的校验矩阵的列权趋于2。作为一类重要的NBLDPC码，GF（q）（q64）上的（2，ρ）-正则NBLDPC码，其校验矩阵的行重为ρ，列重为2，在各种信道下都有很好的性能。这类NBLDPC码，即所谓的NBLDPC循环码，已经引起了广泛的关注[1-3]。在这些工作中，所设计的代码都具有良好的性能。对于给定的码速率和码长，研究哪一个具有最佳的误码性能是非常有意义的。
Dear editor, Nonbinary low-density parity-check (NBLDPC) codes have the ability of approaching capacity when decoded iteratively using a probabilistic decoding algorithm. With the increase of the finite field size q, NBLDPC codes over GF(q) have much better performance under iterative decoding for a constant code length. For q sufficiently large, there is no significant performance improvement while increasing q, moreover the column weights of the parity-check matrices of the best codes tend to 2. As an important class of NBLDPC codes, (2, ρ)-regular NBLDPC codes over GF(q) (q > 64), whose parity-check matrices have row weight ρ and column weight 2, perform well over various channels. This class of NBLDPC codes, so-called NBLDPC cycle codes, has attracted much attention [1–3]. Among these works, all designed codes have good performance. For a given code rate and code length, it is of great interest to study which one of them has the best error performance.