电子学报2016，Vol.44Issue(8)：1814-1819,6.DOI:10.3969/j.issn.0372-2112.2016.08.006
任意列重大围长QC-LDPC码的确定性构造
Deterministic Construction of QC-LD PC Codes for Any Column Weight with a Large Girth
摘要
Abstract
To cope with the issue of determining cyclic shift coefficients of the quasi-cyclic sub-matrix in the Quasi-Cyclic Low-Density Parity-Check (QC-LDPC)codes,a method was presented based on the arithmetic progression to com-pute the cyclic shift coefficients.By this method,a class of girth eight QC-LDPC codes for any column weight is obtained, and the cyclic shift coefficients can be expressed in simple analytic expressions to reduce required memory usage.Mean-while,the encoding complexity is linearly proportional to code length due to the lower triangular parity matrix.The simula-tion result shows that column weight and girth have important influences on code performance.Furthermore,over an Addi-tive White Gauss Noise (AWGN)channel and under the Belief Propagation (BP)decoding algorithm,the simulation re-sults represent that bit error rate of the proposed QC-LDPC codes is no less than the LDPC codes in IEEE 802.11n and 802. 16e with short code length,and is close to the LDPC codes in DVB-S2 with long code length.Moreover,the study result also confirms that the proposed algorithm has high flexibility with respect to the design of code length and rate.关键词
准循环低密度奇偶校验码/列重/围长/准循环基矩阵/高效编码Key words
quasi-cyclic low-density parity-check (QC-LDPC)codes/column weight/girth/quasi-cyclic sub-matrix/efficient encoding分类
信息技术与安全科学引用本文复制引用
张轶,达新宇,苏一栋..任意列重大围长QC-LDPC码的确定性构造[J].电子学报,2016,44(8):1814-1819,6.基金项目
国家自然科学基金 （）
