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

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] JuaneL, Ke-keL, ShuL, KhaledA-G. IEEE Transactions on Communications, 2014, 62: 2626

[2] SmarandacheR, VontobelP O. On Regular Quasi-Cyclic LDPC Codes from Binomials, IEEE International Symposium on Information Theory, 2004, 274

[3] ZhangG H, SunR, WangX M. IEEE Communications Letters, 2013, 17: 369

[4] ZhangY, DaX. Electronics Letters, 2015, 51: 1257

[5] WangJ, ZhangG, ZhouQ, YangY, SunRExplicit Constructions for Type-1 QC-LDPC Codes with Girth at Least TenIEEE Information Theory Workshop, 2014, 436

[6] LallyKExplicit Construction of Type-II QC-LDPC Codes with Girth at Least 6IEEE International Symposium on Information Theory, 2007, 2371

[7] O'SullivanM E. IEEE Transactions on Information Theory, 2006, 52: 718

[8] SmarandacheR, VontobelP O. IEEE Transactions on Information Theory, 2012, 58: 585

[9] ZhangL, LiB, ChengL. Chinese Journal of Electronics, 2015, 24: 146

[10] ZhangG H. Electronics Letters, 2016, 52: 367

[11] RichardsonT J, UrbankeR L. IEEE Transactions on Information Theory, 2001, 47: 638

[12] JohnsonS J, WellerS R. IEEE Transactions on Communications, 2008, 56: 1201

[13] YuanJ-g, ZhouG-x, GaoW-c, WangY, LinJ-z, PangY. Optoelectronics Letters, 2016, 12: 61

[14] PengL, ZhuG, WuX. Acta Electronica Sinica, 2007, 35: 950

[15] YuanJ-g, LiangM-q, WangY, LinJ-z, PangY. Optoelectronics Letters, 2016, 12: 208

[16] EsmaeiliM, JavedankheradM. IEEE Transactions on Communications, 2012, 60: 3579