一种基于循环移位矩阵的LDPC码构造方法

乔华; 管武; 董明科; 项海格

doi:10.3724/SP.J.1146.2007.00526

一种基于循环移位矩阵的LDPC码构造方法

doi: 10.3724/SP.J.1146.2007.00526

基金项目:

国家部级基金(9140A22030106JW02)资助课题

计量
- 文章访问数: 4144
- HTML全文浏览量: 121
- PDF下载量: 1894
- 被引次数: 0
出版历程
- 收稿日期: 2007-04-06
- 修回日期: 2007-09-19
- 刊出日期: 2008-10-19

Construction of LDPC Codes Based on Circulant Permutation Matrices

摘要

摘要: 具有准循环结构的低密度奇偶校验码(QC-LDPC Codes)是目前被广泛采用的一类LDPC码。本文提出了一种结合PEG算法构造基于循环移位矩阵的QC-LDPC码的方法。该方法首先将QC-LDPC码传统的基于比特的二分图简化为基于Block的二分图，然后在该图中采用PEG算法遵循的环路最大原则确定每一个循环移位矩阵的位置，最后根据QC-LDPC码的环路特性为每一个循环移位矩阵挑选循环移位偏移量。利用该算法，本文构造了长度从1008bit到8064bit，码率从1/2到7/8各种参数的LDPC码。仿真结果表明，本文构造的LDPC码性能优于目前采用有限几何、两个信息符号的RS码、组合数学等常用的代数方法构造的QC-LDPC码。
- 准循环低密度奇偶校验码 /
- PEG算法 /
- 循环移位矩阵
Abstract: Quasi Cyclic LDPC (QC-LDPC) codes are of particular interest in various areas. In this paper, a method to construct a class of QC-LDPC codes based on circulant permutation matrices is showed. The method chooses the position of each non-zero sub-matrix in the bipartite graph based on blocks. Then the circulant permutation value of each sub-matrix is decided. With the proposed algorithm, a few LDPC codes were constructed with the code length from 1008 bit to 8064 bit and with code rate from 1/2 to 7/8. Simulation results show that the proposed LDPC codes are superior to QC-LDPC codes with other construction algorithms.
- Q /
- u

HTML全文

参考文献(1)

[1] Hu X Y, Eleftheriou E, and Arnold D M. Regular andirregular progressive edge-growth tanner graphs[J].IEEE Trans.on Inf. Theory.2005, 51(1):386-398 [2] Mansour M M and Shanbhag N R. A novel designmethodology for high-performance programmable decodercores for AA-LDPC codes. SIPS03., Seoul, Aug. 2003: 29-34. [3] Kou Y, Lin S, and Fossorier M P C. Low-density parity-checkcodes based on finite geometries: A rediscovery and newresults[J].IEEE Trans. on Inf. Theory.2001, 47(7):2711-2736 [4] Djurdjevic I, Xu J, Abdel-Ghaffar K, and Lin S. A class oflow-density parity-check codes constructed based on Reed-Solomon codes with two information symbols[J].IEEE Comm.Lett.2003, 7(7):317-319 [5] Ammar B, Honary B, Kou Y, Xu J, and Lin S. Constructionof low-density parity-check codes based on balancedincomplete block designs[J].IEEE Trans. on Inf. Theory.2004,50(6):1257-1269 [6] Xu J, Zeng L, Lan L, Chen L, and Lin S. Construction oflow-density parity-check codes by superposition[J].IEEE Trans.on Comm.2005, 53(2):243-251 [7] Kim K S, Lee S H, Kim Y H, and Ahn J Y. Design of binaryLDPC code using cyclic shift matrices[J].Elec. Lett.2004, 40(5):325-326 [8] Fossorier M P C. Quasicyclic low-density parity-check codesfrom circulant permutation matrices[J].IEEE Trans. on Inf.Theory.2004, 50(8):1788-1793 [9] Myung Seho, Yang Kyeongcheol, and Kim Jaeyoel.Quasi-cyclic LDPC codes for fast encoding[J].IEEE Trans. onInf. Theory.2005, 51(8):2894-2901 [10] Li Z W and Kumar B V K V. A class of good quasi-cyclic low-density parity check codes based on progressive edge growthgraph. Signals.[J].Systems and Computers04., California.2004,:- [11] Chung S Y, Richardson T J, and Urbanke R L. Analysis ofsum-product decoding of low-density parity-check codesusing a Gaussian approximation[J].IEEE Trans. on Inform.Theory.2001, 47(2):657-670

施引文献

资源附件(0)

访问统计