| Summary: | In this paper, a new systematic construction of optimized protograph generalized low-density parity-check codes with good decoding threshold and low error floor is proposed. First, a typical code graph is generated by combining an accumulate-repeat-accumulate seed protograph with a Tanner graph extension of a simple linear block node. Subsequently, it is analyzed and optimized theoretically, especially with the puncture mechanism, by a modified extrinsic information transfer chart and an asymptotic weight distribution. The generated graph is then extended to a base matrix by a copy-and-permute procedure, accompanied with the matrix split, which is optimized by a progressive edge growth for good randomness and girth property. Finally, the proposed code matrix is created by replacing “1”in the above base matrix with square circulant sub-matrices, the offsets of which are searched by a quasi-cyclic (QC)-oriented modified approximate cycle extrinsic message degree algorithm to improve the cycle relationship, especially for the compound cycles. Simulation results show that the codes exhibit excellent performance in both error floor and waterfall region on an additive white Gaussian noise channel. Moreover, they are also characterized by faster encoding due to the QC structure as well as lower decoding complexity and less latency, which make them a natural fit for new-generation power constrained wireless communications.
|
|---|
