Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding
Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding
复制标题
DOI：
10.1093/ietfec/e90-a.7.1432
复制
发表时间：
2007-07
期刊：
影响因子：
--
通讯作者：
Ryoji Ikegaya;K. Kasai;T. Shibuya;K. Sakaniwa
中科院分区：
文献类型：
--
作者：
Ryoji Ikegaya;K. Kasai;T. Shibuya;K. Sakaniwa
在本文中，我们推导出一个标准的不规则低密度奇偶校验（LDPC）码集成下的最大似然（ML）解码的平均块错误概率的上界。此外，我们表明，上界渐近多项式减少的代码长度。此外，当我们考虑在加性白色高斯噪声信道上的几个规则LDPC码集合作为标准非规则LDPC码集合的特殊情况时，我们数值计算表明，信噪比（SNR）当码长趋于无穷大时，所提出的界收敛到零的阈值小于米勒等人提供的界。我们还给出了一个标准的非规则LDPC码系综的例子其具有比给定的常规LDPC码系综更低的SNR阈值。
In this paper, we derive an upper bound for the average block error probability of a standard irregular low-density parity-check (LDPC) code ensemble under the maximum-likelihood (ML) decoding. Moreover, we show that the upper bound asymptotically decreases polynomially with the code length. Furthermore, when we consider several regular LDPC code ensembles as special cases of standard irregular ones over an additive white Gaussian noise channel, we numerically show that the signal-to-noise ratio (SNR) thresholds at which the proposed bound converges to zero as the code length tends to infinity are smaller than those for a bound provided by Miller et al. We also give an example of a standard irregular LDPC code ensemble which has a lower SNR threshold than a given regular LDPC code ensemble.