Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

LI Ling-xiang; LI Hai-bing; LI Ji-bi; JIANG Hua

doi:doi:10.1007/s11801-017-7082-x

光电子快报（英文版）, 2017, 13 (5): 358, Published Online: Sep. 13, 2018

Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

论文大纲

LI Ling-xiang ^1,*LI Hai-bing ²LI Ji-bi ³JIANG Hua ⁴

Author Affiliations

¹ School of Electronics and Information Engineering, Hunan University of Science and Engineering, Yongzhou 425199, China

² BNP Paribas, 787 Seventh Avenue, New York 10019, U.S.A.

³ College of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

⁴ Key Laboratory of Granular Computing, Minnan Normal University, Zhangzhou 363000, China

Abstract

In view of the problems that the encoding complexity of quasi-cyclic low-density parity-check (QC-LDPC) codes is high and the minimum distance is not large enough which leads to the degradation of the error-correction performance, the new irregular type-II QC-LDPC codes based on perfect cyclic difference sets (CDSs) are constructed. The parity check matrices of these type-II QC-LDPC codes consist of the zero matrices with weight of 0, the circulant permutation matrices (CPMs) with weight of 1 and the circulant matrices with weight of 2 (W2CMs). The introduction of W2CMs in parity check matrices makes it possible to achieve the larger minimum distance which can improve the error- correction performance of the codes. The Tanner graphs of these codes have no girth-4, thus they have the excellent decoding convergence characteristics. In addition, because the parity check matrices have the quasi-dual diagonal structure, the fast encoding algorithm can reduce the encoding complexity effectively. Simulation results show that the new type-II QC-LDPC codes can achieve a more excellent error-correction performance and have no error floor phenomenon over the additive white Gaussian noise (AWGN) channel with sum-product algorithm (SPA) iterative decoding.

References

[1] Juane Li, Ke-ke Liu, Shu Lin and Khaled Abdel-Ghaffar, IEEE Transactions on Communications 62, 2626 (2014).

[2] R Smarandache and P O Vontobel, On Regular Quasi-Cyclic LDPC Codes from Binomials, IEEE International Symposium on Information Theory, 274 (2004).

[3] Zhang G H, Sun R and Wang X M, IEEE Communications Letters 17, 369 (2013).

[4] Zhang Y and Da X, Electronics Letters 51, 1257 (2015).

[5] Wang J, Zhang G, Zhou Q, Yang Y and Sun R, Explicit Constructions for Type-1 QC-LDPC Codes with Girth at Least Ten, IEEE Information Theory Workshop, 436 (2014).

[6] Lally K, Explicit Construction of Type-II QC-LDPC Codes with Girth at Least 6, IEEE International Symposium on Information Theory, 2371 (2007).

[7] O'Sullivan M E, IEEE Transactions on Information Theory 52, 718 (2006).

[8] Smarandache R and Vontobel P O, IEEE Transactions on Information Theory 58, 585 (2012).

[9] Zhang L, Li B and Cheng L, Chinese Journal of Electronics 24, 146 (2015).

[10] Zhang G H, Electronics Letters 52, 367 (2016).

[11] Richardson T J and Urbanke R L, IEEE Transactions on Information Theory 47, 638 (2001).

[12] Johnson S J and Weller S R, IEEE Transactions on Communications 56, 1201 (2008).

[13] Yuan Jian-guo, Zhou Guang-xiang, Gao Wen-chun, Wang Yong, Lin Jin-zhao and Pang Yu, Optoelectronics Letters 12, 61 (2016).

[14] Peng L, Zhu G and Wu X, Acta Electronica Sinica 35, 950 (2007). (in Chinese)

[15] YUAN Jian-guo, Liang Meng-qi, Wang Yong, Lin Jin-zhao and Pang Yu, Optoelectronics Letters 12, 208 (2016).

[16] Esmaeili M and Javedankherad M, IEEE Transactions on Communications 60, 3579 (2012).

LI Ling-xiang, LI Hai-bing, LI Ji-bi, JIANG Hua. Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets[J]. 光电子快报（英文版）, 2017, 13(5): 358.

Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

关于本站 Cookie 的使用提示

全站搜索

Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

相关论文

相关资讯

关于本站 Cookie 的使用提示

全站搜索