A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay Cooperation

This correspondence presents a jointly designed quasicyclic (QC) low-density parity-check (LDPC) coded-relay cooperation with joint-iterative decoding in the destination node. Firstly, a design-theoretic construction of QC-LDPC codes based on a combinatoric design approach known as optical orthogonal codes (OOC) is presented. Proposed OOC-based construction gives three classes of binary QC-LDPC codes with no length-4 cycles by utilizing some known ingredients including binary matrix dispersion of elements of finite field, incidence matrices, and circulant decomposition. Secondly, the proposed OOC-based construction gives an effective method to jointly design length-4 cycles free QC-LDPC codes for coded-relay cooperation, where sum-product algorithm- (SPA-) based joint-iterative decoding is used to decode the corrupted sequences coming from the source or relay nodes in different time frames over constituent Rayleigh fading channels. Based on the theoretical analysis and simulation results, proposed QC-LDPC coded-relay cooperations outperform their competitors under same conditions over the Rayleigh fading channel with additive white Gaussian noise.

[1]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

[2]  E. van der Meulen.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[3]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[4]  Fan Chung Graham,et al.  Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.

[5]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[6]  Guosen Yue,et al.  LDPC-coded cooperative relay systems: performance analysis and code design , 2008, IEEE Transactions on Communications.

[7]  Yanxun Chang,et al.  Constructions for optimal optical orthogonal codes , 2003, Discret. Math..

[8]  Yan Zhang,et al.  Performance Analysis for Cooperative Communication System with QC-LDPC Codes Constructed with Integer Sequences , 2015 .

[9]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

[10]  Qiuju Diao,et al.  A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes , 2012, IEEE Transactions on Information Theory.

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

[12]  Jinhua Wang,et al.  A new class of optimal optical orthogonal codes with weight six , 2015, 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA).

[13]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme , 2014, IEEE Transactions on Communications.

[14]  Guosen Yue,et al.  LDPC Code Design for Half-Duplex Cooperative Relay , 2008, IEEE Transactions on Wireless Communications.

[15]  G. Ge,et al.  Constructions for optimal (v, 4, 1) optical orthogonal codes , 2001, IEEE Trans. Inf. Theory.

[16]  Wuyang Zhou,et al.  A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach , 2019, Wirel. Commun. Mob. Comput..

[17]  Fengfan Yang,et al.  Joint iterative decoding for pragmatic irregular LDPC-coded multi-relay cooperations , 2011 .

[18]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[19]  Tuvi Etzion,et al.  Constructions for optimal constant weight cyclically permutable codes and difference families , 1995, IEEE Trans. Inf. Theory.

[20]  Shojiro Sakata,et al.  A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8 , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[21]  Thomas E. Fuja,et al.  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels , 2006, IEEE Transactions on Information Theory.

[22]  G. Ge,et al.  Starters and related codes , 2000 .

[23]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[24]  Sanjay Karmakar,et al.  The Diversity-Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel , 2011, IEEE Transactions on Information Theory.

[25]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

[26]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[27]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[28]  Charles J. Colbourn,et al.  Recursive constructions for optimal (n,4,2)-OOCs , 2004 .

[29]  Jean-Pierre Cances,et al.  Optimized low density parity check codes designs for half duplex relay channels , 2009, IEEE Transactions on Wireless Communications.

[30]  Charles J. Colbourn,et al.  Optimal (n, 4, 2)-OOC of small orders , 2004, Discret. Math..

[31]  Sina Vafi,et al.  A New Scheme of High Performance Quasi-Cyclic LDPC Codes With Girth 6 , 2015, IEEE Communications Letters.

[32]  Salama Ikki,et al.  Performance Analysis of Incremental Relaying Cooperative Diversity Networks over Rayleigh Fading Channels , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[33]  Qiuju Diao,et al.  LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing , 2013, IEEE Transactions on Information Theory.

[34]  Yanxun Chang,et al.  A New Class of Optimal Optical Orthogonal Codes With Weight Five , 2004, IEEE Trans. Inf. Theory.

[35]  Jong-Seon No,et al.  Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families , 2012, IEEE Transactions on Communications.

[36]  Aria Nosratinia,et al.  Diversity of MMSE MIMO Receivers , 2010, IEEE Transactions on Information Theory.

[37]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

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

[39]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[40]  Yanxun Chang,et al.  Combinatorial constructions of optimal optical orthogonal codes with weight 4 , 2003, IEEE Trans. Inf. Theory.

[41]  Sarah J. Johnson,et al.  Resolvable 2-designs for regular low-density parity-check codes , 2003, IEEE Trans. Commun..

[42]  Ryoh Fuji-Hara,et al.  Optical orthogonal codes: Their bounds and new optimal constructions , 2000, IEEE Trans. Inf. Theory.

[43]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[44]  K. Chen,et al.  Existence of (q, k, 1) difference families with q a prime power and k = 4, 5 , 1999 .

[45]  Morteza Esmaeili,et al.  Construction of Structured Regular LDPC Codes: A Design-Theoretic Approach , 2013, IEEE Transactions on Communications.

[46]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[47]  L. Zhu,et al.  Existence of (q,6,1) Difference Families withq a Prime Power , 1998, Des. Codes Cryptogr..

[48]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..

[49]  Yanxun Chang,et al.  Optimal (4up, 5, 1) optical orthogonal codes , 2004 .