Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

被引：1
|
作者：
Rybin, P. S. [1 ]
Zyablov, V. V. [1 ]
机构：
[1] Russian Acad Sci, Kharkevich Inst Informat Transmiss Problems, Moscow, Russia
来源：
PROBLEMS OF INFORMATION TRANSMISSION | 2015年 / 51卷 / 03期
基金：
俄罗斯科学基金会;
关键词：
EXPANDER CODES; EXPONENTS;
D O I：
10.1134/S0032946015030011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of a generalized LDPC code with a special construction is proposed. The error exponent lower bound for the modified decoding algorithm is obtained. Finally, numerical results for the considered error exponent lower bounds are presented and analyzed.
引用
收藏
页码：205 / 216
页数：12
相关论文
共 50 条
12345