Construction of Good Quasi-Cyclic LDPC codes Based on the row vectors of generator matrix

摘要：

The existing construction of Quasi-Cyclic low-density parity-check (short for QC-LDPC) codes has not considered the problems of small stopping sets and small girth and small minimum code weight together, while their existences will lead to the BER performance of QC-LDPC codes to be much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the QC-LDPC codes without small stopping sets and small girth were proposed first. Then good QC-LDPC codes without small stopping sets and small girth were designed based on the row vectors of generator matrix. The small minimum code weight also can be prevented due to the new algorithm based on the row vectors of generator matrix, which is the new way to choose the shifted factors to construct the good QC-LDPC codes for the given prime. The effectiveness and the practicability of the algorithm are demonstrated by the simulation results．It is significant for us to analyze and optimize the design of LDPC codes.

关键词： Quasi-Cyclic low-density parity-check codes,stopping set stopping distance girth minimum code weight

作者: Lingjun Kong Yang Xiao

作者单位: Institute of Information Science,Beijing Jiaotong University Beijing 100044,P.R.China

会议类型: 国际会议

会议名称: The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）