Generalised Quasi-Cyclic LDPC codes based on Progressive Edge Growth Techniques for block fading channels
André Gustavo Degraf Uchôa, Cornelius T. Healy, Rodrigo C. de Lamare, Richard Demo Souza · 2012
Generalised Quasi-Cyclic Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are suitable for channels under F= 3, 4 independent fadings per codeword which is a scenario that has not been previously considered. A generalised Quasi-Cyclic Root-Check structure is devised for F= 3, 4 independent fadings. The proposed PEG-based algorithm for generalised Quasi-Cyclic Root-Check LDPC codes takes into account the specific structure, and designs a parity-check matrix with a reduced number of cycles. The performance of the new codes is investigated in terms of the Frame Error Rate (FER). Numerical results show that the codes constructed by the proposed algorithm perform about 0.5dB from the theoretical limit.