%0 Journal Article
%T A Class of High-Rate Low-Complexity QC-LDPC Codes<br>一种高码率低复杂度准循环LDPC码设计研究
%A Jing Long-jiang Lin Jing-li Zhu Wei-le
%A <br>敬龙江
%A 林竞力
%A 朱维乐
%J 电子与信息学报
%D 2008
%I 
%X This paper proposes a class of Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes with high code rates, which is an efficient encoding algorithm due to the almost lower triangular form and simple structure of their parity-check matrices. Since the parity-check matrix of the QC-LDPC code is composed of blocks of circulant matrices, the required memory for storing it can be significantly reduced, compared with randomly constructed LDPC codes. Based on the quasi-cyclic structure of the parity-check matrix, a new approach is proposed to analyze the distribution of the short length cycles of their bipartite graph, and a corresponding construction method of QC-LDPC codes without cycles of length 4 is presented. Simulation results show that the proposed codes not only have low encoding complexity and low error floor but also perform well with iterative decoding.
%K QC-LDPC code
%K BP iterative decoding
%K Efficient encoding
%K Bipartite graph<br>QC-LDPC码
%K BP迭代译码
%K 高效编码
%K 二分图
%K 高码率
%K 低复杂度
%K 准循环
%K LDPC
%K 设计研究
%K Codes
%K 误码
%K 纠错能力
%K 编码复杂度
%K 仿真结果
%K 计算机
%K 构造方法
%K 分布情况
%K 短长度
%K 二分图
%K 分析
%K 线性关系
%K 码长
%K 编码方法
%K 递推
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=A1C3269EAC14F94FC1852600B9DBF318&yid=67289AFF6305E306&vid=340AC2BF8E7AB4FD&iid=B31275AF3241DB2D&sid=09D89DB7E3DF529E&eid=79D108842269596A&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=1&reference_num=15