Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
复制标题
DOI：
10.1109/tit.2011.2176717
复制
发表时间：
2012-04-01
影响因子：
2.5
通讯作者：
Satyukov, Roman V.
中科院分区：
文献类型：
--
作者：
Bocharova, Irina E.;Hug, Florian;Satyukov, Roman V.
准循环（QC）低密度奇偶校验（LDPC）码的校验矩阵与二部图的双邻接矩阵之间的关系支持寻找功能强大的LDPC分组码。利用咬尾原理，得到了基于卷积码的二部图的紧致表示，并讨论了由此构造的LDPC分组码的围长和最小距离的界.提出了大围长LDPC分组码的迭代搜索算法及其最小距离确定算法。介绍了基于全一矩阵、Steiner三元系和QC分组码的构造。最后给出了围长为24的新的准循环规则LDPC分组码。
The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found. Bounds on the girth and the minimum distance of LDPC block codes constructed in such a way are discussed. Algorithms for searching iteratively for LDPC block codes with large girth and for determining their minimum distance are presented. Constructions based on all-one matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.