A Class of (3, k) Quasi-Cyclic LDPC Codes from Difference Sequences with Girth 8

摘要：

An approach for constructing a class of (3, k)-regular quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which is based on combinatorial objects termed difference sequences. By an efficient algorithm for searching good difference sequences, codes in this class have girth at least eight. Simulation results show that the codes slightly outperform the counterpart PEG codes and have better performance than the corresponding MacKay codes and array codes.

关键词： difference sequences quasi-cyclic low-density parity-check codes girth

作者: Bing Li Lijun Zhang Lee Lung Cheng

作者单位: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, 100044, P. R Department of Electronic Engineering, City University of Hong Kong, Hong Kong, P. R. China

会议类型: 国际会议

会议名称: 2011 the Iet 4th International Conference on Wireless,Mobile & Multimedia Networks(第四届无线、移动及多媒体网络国际会议 ICWMMN2011)

会议地点: 北京

会议语种:英文

页码: 108-113

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