Anti-burst PEG Algorithm for P-LDPC Codes with Short-to-Medium Length

Protograph low-density parity-check (P-LDPC) codes are widely researched in communication systems due to the simple encoder structure and high-speed iterative decoding implementation. The key factors to affect the performance of P-LDPC codes are the base matrix and the lifting method. This paper focuses on the lifting method of P-LDPC codes with short-to-medium length over burst-error channels. An improved anti-burst protograph progressive edge-growth (IPPEG) algorithm based on edge constraints is proposed to improve the bit error rate (BER) performance. Simulation results show that the proposed IPPEG has better burst-resistance performance than the traditional PEG based lifting algorithm (PPEG) with or without random interleaver; additionally, on the premising of correctly decoding, more coding gains of IPPEG can be achieved with condition of larger channel transition probability, shorter code length or smaller coding rate.