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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Juane Li, Ke-ke Liu, Shu Lin and Khaled Abdel-Ghaffar, IEEE Transactions on Communications 62, 2626 (2014).
R Smarandache and P O Vontobel, On Regular Quasi-Cyclic LDPC Codes from Binomials, IEEE International Symposium on Information Theory, 274 (2004).
Zhang G H, Sun R and Wang X M, IEEE Communications Letters 17, 369 (2013).
Zhang Y and Da X, Electronics Letters 51, 1257 (2015).
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).
Lally K, Explicit Construction of Type-II QC-LDPC Codes with Girth at Least 6, IEEE International Symposium on Information Theory, 2371 (2007).
O'Sullivan M E, IEEE Transactions on Information Theory 52, 718 (2006).
Smarandache R and Vontobel P O, IEEE Transactions on Information Theory 58, 585 (2012).
Zhang L, Li B and Cheng L, Chinese Journal of Electronics 24, 146 (2015).
Zhang G H, Electronics Letters 52, 367 (2016).
Richardson T J and Urbanke R L, IEEE Transactions on Information Theory 47, 638 (2001).
Johnson S J and Weller S R, IEEE Transactions on Communications 56, 1201 (2008).
Yuan Jian-guo, Zhou Guang-xiang, Gao Wen-chun, Wang Yong, Lin Jin-zhao and Pang Yu, Optoelectronics Letters 12, 61 (2016).
Peng L, Zhu G and Wu X, Acta Electronica Sinica 35, 950 (2007). (in Chinese)
YUAN Jian-guo, Liang Meng-qi, Wang Yong, Lin Jin-zhao and Pang Yu, Optoelectronics Letters 12, 208 (2016).
Esmaeili M and Javedankherad M, IEEE Transactions on Communications 60, 3579 (2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work has been supported by the National Natural Science Foundation of China (No.61472464), the Research Foundation of Education Bureau of Hunan Province in China (No.16C0686), and the Key Discipline Construction Project Funding for Hunan University of Science and Engineering (Electrical systems).
Rights and permissions
About this article
Cite this article
Li, Lx., Li, Hb., Li, Jb. et al. Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets. Optoelectron. Lett. 13, 358–362 (2017). https://doi.org/10.1007/s11801-017-7082-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11801-017-7082-x