Outage-Limit-Approaching Channel Coding for Future Wireless Communications: Root-Protograph Low-Density Parity-Check Codes

A block-fading (BF) channel, also known as a slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility. Although BF channels have received significant research attention in the past 20 years, designing low-complexity, outage-limit-approaching error-correction codes (ECCs) is still a challenging issue. For this reason, a novel family of protograph low-density paritycheck (LDPC) codes, called rootprotograph (RP) LDPC codes, has been conceived recently. The RP codes not only can realize linearcomplexity encoding and highspeed decoding with the help of the quasi-cyclic (QC) structure but can also achieve near-outage-limit performance in different BF scenarios. In this article, we briefly review the design guidelines of such protograph codes with the aim of inspiring further research activities in this area.

[1]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[2]  Lin Wang,et al.  Rate-Compatible Root-Protograph LDPC Codes for Quasi-Static Fading Relay Channels , 2016, IEEE Transactions on Vehicular Technology.

[3]  Soung Chang Liew,et al.  Design of Distributed Protograph LDPC Codes for Multi-Relay Coded-Cooperative Networks , 2017, IEEE Transactions on Wireless Communications.

[4]  David G. M. Mitchell,et al.  Quasi-cyclic LDPC codes based on pre-lifted protographs , 2011, ITW.

[5]  Andrew Thangaraj,et al.  Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds , 2015, IEEE Transactions on Communications.

[6]  Gerhard Fettweis,et al.  5G-Enabled Tactile Internet , 2016, IEEE Journal on Selected Areas in Communications.

[7]  Aria Nosratinia,et al.  Cooperative communication in wireless networks , 2004, IEEE Communications Magazine.

[8]  Walaa Hamouda,et al.  Multi-Relay Turbo-Coded Cooperative Diversity Networks Over Nakagami- $m$ Fading Channels , 2013, IEEE Transactions on Vehicular Technology.

[9]  Amir H. Banihashemi,et al.  On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles , 2017, IEEE Transactions on Information Theory.

[10]  Ali Ghrayeb,et al.  A Convolutional-Based Distributed Coded Cooperation Scheme for Relay Channels , 2009, IEEE Transactions on Vehicular Technology.

[11]  Sergio VerdÂ,et al.  Fading Channels: InformationTheoretic and Communications Aspects , 2000 .

[12]  Gianluigi Liva,et al.  Improving the Decoding Threshold of Tailbiting Spatially Coupled LDPC Codes by Energy Shaping , 2018, IEEE Communications Letters.

[13]  J. Boutros.  Diversity and coding gain evolution in graph codes , 2009, 2009 Information Theory and Applications Workshop.

[14]  Guoan Bi,et al.  Design and Analysis of Root-Protograph LDPC Codes for Non-Ergodic Block-Fading Channels , 2015, IEEE Transactions on Wireless Communications.

[15]  Marc Moeneclaey,et al.  Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels , 2011, IEEE Transactions on Information Theory.