An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes

An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes
复制标题

DOI：
10.1109/isit.2006.261727
复制
发表时间：
2006-07
期刊：
2006 IEEE International Symposium on Information Theory
影响因子：
--
通讯作者：
Xiaofu Wu;X. You;Chunming Zhao
Xiaofu Wu;X. You;Chunming Zhao
中科院分区：
其他
文献类型：
--
作者：
Xiaofu Wu;X. You;Chunming Zhao

文献摘要

被引文献

相似文献

拟循环码的校验矩阵可以用一个显著低维的多项式校验矩阵来表示。利用这种紧凑表示，我们可以建立一种定位拟循环码周长的有效方法。所提出的周长定位算法可以很好地用于生成大周长的准循环低密度校验码
The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth