Finite-length analysis of low-density parity-check codes on the binary erasure channel
Finite-length analysis of low-density parity-check codes on the binary erasure channel
复制标题
DOI：
10.1109/tit.2002.1003839
复制
发表时间：
2002-06-01
影响因子：
2.5
通讯作者：
Urbanke, RL
中科院分区：
文献类型：
--
作者：
Di, CY;Proietti, D;Urbanke, RL
本文研究了低密度奇偶校验码（LDPC）在二进制擦除信道（BEC）中的有限长度分析。主要结果是一个表达式的确切平均位和块擦除概率为一个给定的规则合奏LDPC码迭代解码时。我们还给出了表达式上界的平均位和块擦除概率的规则LDPC合奏和标准的随机合奏下的最大似然（ML）解码。最后，我们提出了我们认为是在这一领域最重要的开放问题。
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area.