Design of efficient low rate QCARA GLDPC codes

A new method of designing efficient low rate low-density parity-check (LDPC) code is proposed. It is firstly constructed by a basic protograph based accumulate-repeat-accumulate (ARA) code and then extended to a generalized LDPC (GLDPC) code where a parity check node is replaced by a more powerful hamming node. It is implemented in the form of quasi-cyclic (QC) which saves memory resources and greatly reduces the complexity of both encoding and decoding. So the code is called as QCARA GLDPC code since it has features of QC, ARA and GLDPC. Simulation results show that the code designed by the proposed method can achieve lower decoding complexity and less decoding latency at the cost of just 0.3 dB performance loss when compared to the Turbo code of the consultative committee for space data systems (CCSDS) with the same code rate at bit-error-rate (BER) of 10⁻⁵.