基于周长大于6的广义RS码的QC-LDPC码构造

2016 IEEE International Conference on Communication Systems (ICCS) Pub Date : 2016-12-01 DOI:10.1109/ICCS.2016.7833579

Rong Sun, Yu Tian, Jingwei Liu

{"title":"基于周长大于6的广义RS码的QC-LDPC码构造","authors":"Rong Sun, Yu Tian, Jingwei Liu","doi":"10.1109/ICCS.2016.7833579","DOIUrl":null,"url":null,"abstract":"In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.","PeriodicalId":282352,"journal":{"name":"2016 IEEE International Conference on Communication Systems (ICCS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Construction of QC-LDPC codes based on generalized RS codes with girth larger than 6\",\"authors\":\"Rong Sun, Yu Tian, Jingwei Liu\",\"doi\":\"10.1109/ICCS.2016.7833579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.\",\"PeriodicalId\":282352,\"journal\":{\"name\":\"2016 IEEE International Conference on Communication Systems (ICCS)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Communication Systems (ICCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2016.7833579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Communication Systems (ICCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2016.7833579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了一种基于广义Reed-Solomon(GRS)码构造周长大于6的拟循环(QC)-LDPC码的方法。所提出的构造方法与掩蔽相结合，可以得到其坦纳图周长为8或更大的代码。实验结果表明，采用迭代译码算法，构造的QC-LDPC码具有良好的译码性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Construction of QC-LDPC codes based on generalized RS codes with girth larger than 6

In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE International Conference on Communication Systems (ICCS)

自引率

0.00%

发文量