Construction of LDPC Codes Based on Cyclic Shift Matrix

An effective check matrix structure of LDPC codes is proposed, which is based on matrix partition and with the cyclic shift matrix as the basic cell, thus to reduce the decoding complexity. Meanwhile, the structure of approximate lower triangular parity matrix construction based on cyclic shift pattern can also reduce the encoding complexity. Simulations and analytic results indicate that these LDPC codes have superiority over the randomly constructed LDPC codes in loop distributions, minimum Hamming distance and BER.