Joint optimisation technique for multi-edge type low-density parity-check codes

This study considers the optimisation of multi-edge type low-density parity-check (MET-LDPC) codes to maximise the decoding threshold. The authors propose an algorithm to jointly optimise the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimisation is particularly important for MET-LDPC codes as it is not clear a priori which structures will be good. Using several examples, they demonstrate that the MET-LDPC codes designed by the proposed joint optimisation algorithm exhibit improved decoding thresholds compared with previously reported MET-LDPC codes.

[1]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[2]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[3]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[4]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  Vahid Jamali,et al.  On the Design of Fast Convergent LDPC Codes for the BEC: An Optimization Approach , 2014, IEEE Transactions on Communications.

[7]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[8]  Dariush Divsalar,et al.  Low-rate LDPC codes with simple protograph structure , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[9]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[10]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[11]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[12]  Regina Berretta,et al.  Optimization of graph based codes for belief propagation decoding , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[13]  Mahmoud Ahmadian,et al.  Optimal rate irregular low-density parity-check codes in binary erasure channel , 2012, IET Commun..

[14]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[16]  Lars K. Rasmussen,et al.  Design of Multi-Edge-Type Bilayer-Expurgated LDPC Codes for Decode-and-Forward in Relay Channels , 2011 .

[17]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.