On Generalized LDPC Codes for 5G Ultra Reliable Communication

–Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a practical construction of quasi-cyclic (QC) GLDPC codes is proposed, where the proportion of generalized constraints is determined by an asymptotic analysis. We analyze the message passing process and complexity of a GLDPC code over the additive white gaussian noise (AWGN) channel and present a constraint-to-variable update rule based on the specific codewords of the component code. The block error rate (BLER) performance of the GLDPC codes, combined with a complementary outer code, is shown to outperform a variety of state-of-the-art code and decoder designs with suitable lengths and rates for the 5G Ultra Reliable Communication (URC) regime over an additive white gaussian noise (AWGN) channel with quadrature PSK (QPSK) modulation.

[1]  Pablo M. Olmos,et al.  A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC , 2017, IEEE Transactions on Information Theory.

[2]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[3]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[4]  William E. Ryan,et al.  Quasi-Cyclic Generalized LDPC Codes With Low Error Floors , 2007, IEEE Trans. Commun..

[5]  Li Ping,et al.  Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints , 2007, IEEE Transactions on Information Theory.

[6]  Michael Lentmaier,et al.  On the minimum distance of generalized spatially coupled LDPC codes , 2013, 2013 IEEE International Symposium on Information Theory.

[7]  Andrea Montanari,et al.  Finite-Length Scaling for Iteratively Decoded LDPC Ensembles , 2004, IEEE Transactions on Information Theory.

[8]  Manabu Hagiwara,et al.  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.

[9]  Petar Popovski,et al.  Ultra-reliable communication in 5G wireless systems , 2014, 1st International Conference on 5G for Ubiquitous Connectivity.

[10]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[11]  Krzysztof Wesolowski,et al.  Channel Coding for Ultra-Reliable Low-Latency Communication in 5G Systems , 2016, 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall).

[12]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

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

[14]  Tingting Liang,et al.  Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes , 2018, 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC).

[15]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[16]  Michael Lentmaier,et al.  On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.

[17]  Marco Chiani,et al.  Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel , 2010, IEEE Transactions on Information Theory.

[18]  Shanzhi Chen,et al.  The requirements, challenges, and technologies for 5G of terrestrial mobile telecommunication , 2014, IEEE Communications Magazine.