A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Simplified eIRA code design and performance analysis for correlated Rayleigh fading channels
IEEE Transactions on Wireless Communications
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
On decoding of low-density parity-check codes over the binary erasure channel
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
On construction of moderate-length LDPC codes over correlated erasure channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists of starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance over the memoryless erasure channel, and suitable also for the iterative correction of single erasure bursts. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm. It executes permutations of carefully chosen columns of the parity-check matrix, after a local analysis of particular variable nodes called stopping set pivots. This algorithm can be in principle applied to any LDPC code. If the input parity-check matrix is designed to achieve a good performance over the memoryless erasure channel, then the code obtained after the application of the algorithm provides a good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the algorithm effectiveness when applied to different categories of LDPC codes.