A Greedy Search Based Method with Optimized Lower Bound for QC-LDPC Codes

Autonomous decentralized system is need of the dynamically varying society. Various autonomous decentralized systems architecture proposed and deployed, use of IEEE 802.11n/ac (Wi-Fi) and IEEE 802.16e (Wi-max) standards for surveillance purposes in different geographical region. These standards use LDPC codes as a channel code having better error correcting performance. This article deals with a construction of less computational complexity method for constructing exponent matrix (3, K) having girth 8, 10, and 12 of quasi-cyclic low-density parity-check (QC-LDPC) codes. In this method, we first generate a base matrix and then the same matrix is further used for expanding till desired size of the exponent matrix. The construction of code deals with the generation of base matrix by a simple algorithm for girth 8, 10, and 12. Our method is flexible for any block-column length K. Finally, a new method is given with less computational complexity with optimized CPM size.

[1]  Richard D. Wesel,et al.  On the girth of (3,L) quasi-cyclic LDPC codes based on complete protographs , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[2]  Lunchakorn Wuttisittikulkij,et al.  A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem , 2016, Wirel. Pers. Commun..

[3]  Kohichi Sakaniwa,et al.  Some Classes of Quasi-Cyclic LDPC Codes: Properties and Efficient Encoding Method , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[4]  Lunchakorn Wuttisittikulkij,et al.  Design and Implementation of Secure and Reliable Communication using Optical Wireless Communication , 2014 .

[5]  Keshab K. Parhi,et al.  Overlapped message passing for quasi-cyclic low-density parity check codes , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Xinmei Wang,et al.  Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight , 2013, IEEE Communications Letters.

[7]  Gabofetswe Alafang Malema,et al.  Low-Density Parity-Check Codes: Construction and Implementation , 2007 .

[8]  Xinyu Da,et al.  Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight , 2015 .

[9]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[10]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[11]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[12]  Florian Hug,et al.  Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth , 2011, IEEE Transactions on Information Theory.

[13]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[14]  Shu Lin,et al.  Construction of low-density parity-check codes by superposition , 2005, IEEE Transactions on Communications.