arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.1065cs.ITmath.IT
收藏

终止不规则原型LDPC卷积码构成的新的LDPC分组码族

New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes

David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello

摘要:

本文提出了一种通过终止基于不规则原模图的LDPC卷积码来构造新的LDPC分组码系综族的方法。以累积重复4锯齿累积(AR4JA)原模图为例,对二进制擦除信道的密度演化分析表明,这种灵活的设计技术可以产生多种码率和接近容量的门限的LDPC分组码集合.此外,通过渐近权重枚举分析,我们证明了这个家族中的所有系综也具有随块长度线性增长的最小距离,即,它们是渐近好的。

英文摘要:

In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block code ensembles with varying code rates and thresholds close to capacity. Further, by means of an asymptotic weight enumerator analysis, we show that all the ensembles in this family also have minimum distance that grows linearly with block length, i.e., they are asymptotically good.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑