Construction of QC-LDPC codes based on two-dimentional optimization

被引：0
|
作者：
Lin B. [1 ]
Jiang M. [1 ]
Zhao C. [1 ]
机构：
[1] National Mobile Communications Research Laboratory, Southeast University
来源：
Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) | 2010年 / 40卷 / 01期
关键词：
Low-density parity-check codes; Permutation matrix; Progress edge growth; Quasi-cyclic;
D O I：
10.3969/j.issn.1001-0505.2010.01.002
中图分类号：
学科分类号：
摘要：
Several important relations are studied between the girth condition and the ACE (approximated cycle extrinsic message degree) spectrum of the QC-LDPC(quasi-cyclic low-density parity-check) codes, where the PCM(parity-check matrices) are defined by the base-matrix and expanded by the cyclic permutation matrices. According to this structure of PCM, a new algorithm for constructing QC-LDPC codes is proposed, which follows the framework of PEG(progress edge growth) algorithm and aims to jointly optimize girth condition and ACE spectrum of LDPC codes. In the proposed algorithm, not only the cycles with short lengths but also the cycles with small ACE values are reduced as far as possible, by setting a reasonable constraint relation to cycle lengths and ACE values. Due to the small dimension of base matrix, our construction can optimize an expansion factors adaptation base-matrix with low complexity and thus a class of QC-LDPC codes with different lengths is obtained. Simulation results show that the LDPC codes constructed by the proposed methodology outperform the QC-LDPC code adopted by IEEE 802.16e with same code length, code rate and degree distribution.
引用
收藏
页码：6 / 10
页数：4
相关论文
共 13 条
  • [1] Gallager R.G., Low density parity check codes, IRE Trans Inform Theory, 8, 1, pp. 21-28, (1962)
  • [2] Fossorier M.P.C., Quasi-cyclic low-density parity-check codes from circulant permutation matrices, IEEE Trans Inform Theory, 50, 8, pp. 1788-1793, (2004)
  • [3] Tanner R.M., Sridhara D., Sridharan A., Et al., LDPC block and convolutional codes based on circulant matrices, IEEE Trans Inform Theory, 50, 12, pp. 2966-2984, (2004)
  • [4] Lan L., Zeng L., Tai Y.Y., Et al., Construction of quasi-cyclic LDPC codes for AWGN and binary erasure hannels: A finite field approach, IEEE Trans Inform Theory, 53, 7, pp. 2429-2458, (2007)
  • [5] Tian T., Jones C., Villasenor J.D., Et al., Selective avoidance of cycles in irregular LDPC code construction, IEEE Trans Commun, 52, 8, pp. 1242-1247, (2004)
  • [6] Kang J., Fan P., Cao Z., Flexible construction of irregular partitioned permutation LDPC codes with low error floors, IEEE Commun Letters, 9, 6, pp. 534-536, (2005)
  • [7] Myung S., Yang K., Lifting methods for quasi-cyclic LDPC codes, IEEE Commun Letters, 10, 6, pp. 489-491, (2006)
  • [8] Sharon E., Litsyn S., Construction LDPC codes by error minimization progressive edge growth, IEEE Trans Commun, 56, 3, pp. 359-368, (2008)
  • [9] Di C., Proietti D., Telatar I.E., Et al., Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans Inform Theory, 48, 6, pp. 1570-1579, (2002)
  • [10] Hu X.Y., Eleftheriou E., Arnold D.M., Progressive edge-growth Tanner graphs, Proc IEEE GLOBECOM, pp. 995-1001, (2001)
12