低复杂度的LDPC码联合编译码构造方法研究_姜明.pdfVIP

第26 卷第2 期 通 信 学 报 Vol. 26 No. 2 2005 年2 月 Journal on Communications February 2005 低复杂度的LDPC 码联合编译码构造方法研究 姜明，赵春明，何善宝, 单鸣 （东南大学移动通信国家重点实验室， 江苏 南京 210096 ） 摘 要：LDPC 码因为其具有接近香农限的译码性能和适合高速译码的并行结构，已经成为纠错编码领域的研究 热点。LDPC 码校验矩阵的构造是基于稀疏的随机图，所以该类码字编码和译码的硬件实现比较复杂。以单位阵 的循环移位阵为基本单元，构造LDPC 码的校验矩阵，降低了LDPC 码在和积算法下的译码复杂度。同时考虑到 LDPC 码的编码复杂度，给出了一种可以简化编码的结构。针对该方案构造的LDPC 码，提出了消除其二分图上 的短圈的方法。通过大量的仿真和计算分析，本文比较了这种LDPC 码和随机构造的LDPC 码在误码率性能，圈 长分布以及最小码间距估计上的差异。 关键词：纠错编码; 低密度奇偶校验码; 循环移位阵; 和积算法 中图分类号：TN929.533 文献标识码：B 文章编号：1000-436X(2005)02-0080-07 Joint encoding-decoding construction of LDPC codes with reduced complexity JIANG Ming, ZHAO Chun-ming, HE Shan-bao, SHAN Ming (National Mobile Communications Research Lab., Southeast University, Nanjing 210096, China) Abstract: LDPC codes are now one of intensely studied areas in coding due to their near Shannon limit performance and parallel decoding architecture. Because the LDPC codes ’ parity-check matrices are defined in terms of sparse random graphs, the implementation of the decoding and encoding is of high complexity. A new design methodology of LDPC codes, which are constructed by the cyclic shift matrices, is proposed in order to reduce the decoding complexity under the Sum-Product algorithm. Meanwhile ，the encoding problem of LDPC codes is also considered, then a simplified encoding structure is given. A new procedure of removing the short loops from the bipartite graph is demonstrated according to the construction scheme of