A new algorithm to construct quasi-cyclic LDPC codes based on the block lower triangle matrix

作者：Duanmu Chunjiang^*; Huang Zhiliang; Zhou Shuihong

来源：Advances in Information Sciences and Service Sciences, 2012, 4(12): 224-232.

DOI：10.4156/AISS.vol4.issue12.26

• Bit error rate (BER) performance
• Block diagonal
• Check matrixes
• Code length
• Encoding complexity
• LDPC codes
• Linear encoding
• Low-density parity-check (LDPC) codes
• Node degree distribution
• Quasi-cyclic LDPC codes
• Triangle matrix

In this paper, a new algorithm for creating the quasi-cyclic LDPC codes is proposed, which improves on the work by Myung. By replacing a component matrix in the check matrix H with the two block diagonals to a block lower triangle matrix, it gives more freedom to design the LDPC codes. The check matrix H in the proposed algorithm is optimally designed and analyzed, so that the resulting LDPC code still has the encoding complexity that is linear to the code length, and at the same time the node degree distribution is nearly optimal, which is not possible in Myung's work. Since the proposed codes have nearly optimal node degree distribution, better bit error rate (BER) performance can be achieved, which is demonstrated by the simulation results.

• 出版日期2012
• 单位东南大学