期刊文献+

一种高围长低复杂度LDPC码构造方法

LDPC Codes Construction with High Girth Low Complexity
下载PDF
导出
摘要 LDPC(低密度奇偶校验)码常见的编码方法常常无法将校验矩阵的围长和线性无关相统一,对编译码复杂度和译码性能有一定影响。文章提出了一种低复杂度LDPC的构造方法,通过构造分块矩阵A和B,获得一个围长为10、列重为2、具有近似下三角形式的校验矩阵,且矩阵各行之间线性无关。该码具有以下优点:较高的围长能提升译码性能;较低的列重使该码适合在部分响应信道传播;近似下三角形式和线性无关的特性,较好地降低了编译码的复杂度。采用Matlab软件的仿真结果表明,在高斯白噪声信道、BP(置信传播)译码算法下,该码比普通的10围长LDPC码具有更低的复杂度,比普通的6围长LDPC码具有更好的译码性能。 The conventional encoding method of Low Density Parity Check (LDPC)Code often cannot put the girth and nonsin-gularity of check matrices into consideration at the same time,which has negative effects on the performances of encoding and decoding,and increases the decoding complexity.A low complexity method to construct check matrices is presented.A matrix with properties of girth of 10,column weight of 2,nonsingularity,and approximate lower triangular is generated by construc-ting the sub-matrix A and sub-matrix B step by step.Due to these features,some advantages such as better decoding perform-ance,more suitable for partial response channels,lower encoding and decoding complexity are shown.The simulation result shows that the proposed coding scheme has lower complexity than the code with girth of 10.It also presents better decoding performance than common code with girth of 6 in AWGN channels after Belief Propagation(BP)decoding algorithm.
出处 《光通信研究》 北大核心 2016年第5期27-28,54,共3页 Study on Optical Communications
基金 国家自然科学基金资助项目(61162008) 广西科学研究与技术开发项目(12118017-5)
关键词 低密度奇偶校验码 高围长 低复杂度 近似下三角 线性无关 LDPC code high girth low complexity approximate lower triangular nonsingularity
  • 相关文献

参考文献2

二级参考文献9

  • 1Liu K, Fei Z, Kuang J. Novel algebraic constructions of nonbinary structured LDPC codes over finite fields [ C ]. in 68th IEEE VTC-Fall,2008:1-5.
  • 2Myung S. Yang K, A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem [ J ]. IEEE Commun. Lett. ,2005,9(9): 823-825.
  • 3Zhang J-W, Li C-X, Bao J-R. A construction method of QC-LDPC codes without short cycles C ]. 4th internation- al conference on multimedia information networking and security. 2012,138-141.
  • 4Zhang G, Sun R, Wang X. Construction of girth-eight QC- LDPC codes from greatest common divisor [ J ]. IEEE Commun. Lett. ,2013,17 (2) :369-372.
  • 5Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [ J ]. IEEE Trans. Inf. Theory,2004,50(8) : 1788-1793.
  • 6Wu X F, You X H, Zhao C M. A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes [ J 1- IEEE Trans. Commun. , 2008,56 ( 6 ) : 854- 867.
  • 7Vasie B, Pedagani K Ivkovic M. High-rate girth-eight mow- density parity-check codes on rectangular integer lattices [ J ]. IEEE Trans. Commun. , 2004,52 ( 8 ) : 1248-1252.
  • 8Zhang G, Sun R, Wang X. New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences [ C ]. in Proe. International Symp. Turbo Codes Iterative Inf. Process,2012:31-35.
  • 9张国华,张建华.一种基于环路分类和启发式搜索的大围长QC-LDPC码构造新方法[J].空间电子技术,2013,10(2):79-84. 被引量:2

共引文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部