Construction of Burst-Erasure Efficient LDPC Codes for Use with Belief Propagation Decoding

In this paper, we consider the optimal permutation of encoded symbols that will result in the maximum burst erasure efficiency for a given low-density parity-check (LDPC) code under belief propagation (BP) decoding. A novel algorithm is proposed to permute columns of the parity-check matrix to achieve high burst erasure correction efficiencies. This method can be applied to any linear code to increase its burst-erasure efficiency while retaining its random-error correction capability. Results show that the algorithm outperforms previous methods.

[1]  J.C.L. van Peppen,et al.  Electronic Abatement Of Thermal Interference In (G)MR Head Output Signals , 1997, 1997 IEEE International Magnetics Conference (INTERMAG'97).

[2]  Marc P. C. Fossorier.  Hybrid burst erasure correction of LDPC codes , 2009, IEEE Communications Letters.

[3]  William E. Ryan,et al.  Design of LDPC codes for two-state fading channel models , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[4]  Marc P. C. Fossorier.  Universal Burst Error Correction , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Robert D. Hempstead,et al.  Thermally Induced Pulses in Magnetoresistive Heads , 1974, IBM J. Res. Dev..

[6]  M.F. Erden,et al.  Thermal asperity detection and cancellation in perpendicular magnetic recording systems , 2004, IEEE Transactions on Magnetics.

[7]  G. Kerwi,et al.  Magneto-resistive head thermal asperity digital compensation , 1992, 1992. Digests of Intermag. International Magnetics Conference.

[8]  Sarah J. Johnson.  Burst erasure correcting LDPC codes , 2009, IEEE Transactions on Communications.

[9]  Fei Peng,et al.  Simplified eIRA code design and performance analysis for correlated Rayleigh fading channels , 2006, IEEE Transactions on Wireless Communications.

[10]  Jr. G. Forney,et al.  Burst-Correcting Codes for the Classic Bursty Channel , 1971 .

[11]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

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

[13]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

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

[15]  Amir H. Banihashemi,et al.  New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel , 2010, IEEE Trans. Inf. Theory.

[16]  Marco Chiani,et al.  Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes , 2008, IEEE Transactions on Communications.

[17]  Amir H. Banihashemi,et al.  New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel , 2010, IEEE Transactions on Information Theory.

[18]  Srikrishna Bhashyam,et al.  Optimizing burst erasure correction of LDPC codes by interleaving , 2008, 2008 IEEE International Symposium on Information Theory.

[19]  David J. C. MacKay,et al.  Encyclopedia of Sparse Graph Codes , 1999 .

[20]  Jack K. Wolf,et al.  A method for reducing the effects of thermal asperities , 2001, IEEE J. Sel. Areas Commun..