基于替换产品的准循环LDPC码的递归构造

2016 International Conference on Computer, Information and Telecommunication Systems (CITS) Pub Date : 2016-08-18 DOI:10.1109/CITS.2016.7546443

Jiayi Huang, Xueqin Jiang, Xiaodong Zhang, Huiming Wang, Wei Duan

{"title":"基于替换产品的准循环LDPC码的递归构造","authors":"Jiayi Huang, Xueqin Jiang, Xiaodong Zhang, Huiming Wang, Wei Duan","doi":"10.1109/CITS.2016.7546443","DOIUrl":null,"url":null,"abstract":"Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products\",\"authors\":\"Jiayi Huang, Xueqin Jiang, Xiaodong Zhang, Huiming Wang, Wei Duan\",\"doi\":\"10.1109/CITS.2016.7546443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.\",\"PeriodicalId\":340958,\"journal\":{\"name\":\"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITS.2016.7546443\",\"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 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2016.7546443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

产品替换为代码构建提供了一种简单的方法。本文研究了替换积图在QC循环LDPC码递归构造中的应用。证明了用该方法构造的QC循环LDPC码的周长为6。仿真结果表明，由替换产品构建的QC周期LDPC码在AWGN信道上具有良好的性能。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products

Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.

求助全文

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

来源期刊

2016 International Conference on Computer, Information and Telecommunication Systems (CITS)

自引率

0.00%

发文量