A new algorithm of counting the number of small Stopping sets and girth in QC-LDPC Codes

摘要：

It is well known that the performance of low-density parity check (LDPC) codes under iterative decoding is determined by certain combinatorial structures (such as stopping sets and girth) in the Tanner graph.The difficulty in enumerating all possible combinations of the columns may prevent an efficient search of good LDPC codes with small stopping sets and girth.To solve the problem,this paper presents a new algorithm of counting the number of small stopping sets and girth by analyzing the shapes of the cycles of Tanner graph in parity check matrix for designing good LDPC codes which is less complex than the existing algorithms.This method can be used effectively to evaluate the performance of LDPC codes according to their small stopping sets and girth distributions.

关键词： Quasi-Cyclic low-density parity-check(LDPC)codes circulant matrices stopping sets stopping distance girth cycle check algorithm

作者: Lingjun Kong Yang Xiao

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

会议类型: 国际会议

会议名称: 9th International Conference on Signal Processing(第九届国际信号处理学术会议)(ICSP08)

会议地点: 北京

会议语种:英文

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