一种高码率低复杂度准循环LDPC码设计研究

敬龙江; 林竞力; 朱维乐

doi:10.3724/SP.J.1146.2006.01738

一种高码率低复杂度准循环LDPC码设计研究

doi: 10.3724/SP.J.1146.2006.01738

基金项目:

韩国三星公司项目基金(HO4010201 WO20340)资助课题

计量
- 文章访问数: 3472
- HTML全文浏览量: 114
- PDF下载量: 1151
- 被引次数: 0
出版历程
- 收稿日期: 2006-11-06
- 修回日期: 2007-03-21
- 刊出日期: 2008-06-19

A Class of High-Rate Low-Complexity QC-LDPC Codes

摘要

摘要: 该文设计了一种特殊的高码率准循环低密度校验(QC-LDPC)码,其校验矩阵以单位矩阵的循环移位阵为基本单元,与随机构造的LDPC码相比可节省大量存储单元。利用该码校验矩阵的近似下三角特性,一种高效的递推编码方法被提出,它使得该码编码复杂度与码长成线性关系。另外,该文提出一种分析QC-LDPC码二分图中短长度环分布情况的方法,并且给出了相应的不含长为4环QC-LDPC码的构造方法。计算机仿真结果表明,新码不但编码简单,而且具有高纠错能力、低误码平层。
- QC-LDPC码; BP迭代译码; 高效编码; 二分图
Abstract: 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.

HTML全文

参考文献(1)

Gallager R G. Low density parity check codes[J].IRE Trans. onInf. Theory.1962, 8(3):21-28[2]MacKay D J C. Good error-correcting codes based on verysparse matrices[J].IEEE Trans. on Inf. Theory.1999, 45(2):399-431[3]Li Zongwang, Chen Lei, and Zeng Lingqi, et al.. Efficientencoding of quasi-cyclic low-density parity-check codes[J].IEEE Trans. on Commun.2006, 54(1):71-81[4]Li Ping, Leung W K, and Phamdo N. Low density paritycheck codes with semi-random parity check matrix[J].Electron.Lett.1999, 35(1):38-39[5]Richardson T J and Urbanke R. Efficient encoding oflow-density parity-check codes[J].IEEE Trans. on Inf. Theory.2001, 47(2):638-656[6]姜明，赵春明，何善宝，等. 低复杂度的LDPC 码联合编译码构造方法研究. 通信学报, 2005, 26(2): 80-86.Jiang Ming, Zhao Chun-ming, and He Shan-bao, et al.. Jointencoding-decoding construction of LDPC codes. Journal onCommunications, 2005, 26(2): 80-86.[7]Myung Seho, Yang Kyeongcheol, and Kim Jaeyoel. QuasicyclicLDPC codes for fast encoding[J].IEEE Trans. on Inf.Theory.2005, 51(8):2894-2901[8]Xiao Yang and Lee Moon Ho. Low complexity MIMO-LDPCCDMA systems over multipath channels[J].IEICE Trans. onCommun.2006, E89-B(5):1713-1717[9]Kim K S, Lee S H, and Kim Y H, et al.. Design of binaryLDPC code using cyclic shift matrices[J].Electron. Lett.2004,40(5):325-326[10]Kou Y, Lin S, and Fossorier M. Low-density parity-checkcodes based on finite geometries: A rediscovery and newresults[J].IEEE Trans. on Inf. Theory.2001, 47(7):619-637[11]Xu J, Chen L, and Zeng L Q, et al.. Construction of lowdensityparity-check codes by superposition[J].IEEE Trans. onCommun.2005, 53(2):243-251[12]Ammar Bassem, Honary Bahram, and Kou Yu, et al..Construction of low-density parity-check codes based onbalanced incomplete block designs[J].IEEE Trans. on Inf.Theory.2004, 50(6):1257-1268[13]Fan J L. Array codes as low-density parity-check codes. Proc.2nd Int. Symp. Turbo Codes, Brest, France, 2000: 543-546.

施引文献

资源附件(0)

访问统计