高速率QC-LDPC代码的构建

Xu Chen, F. Lau
{"title":"高速率QC-LDPC代码的构建","authors":"Xu Chen, F. Lau","doi":"10.1109/ATC.2011.6027427","DOIUrl":null,"url":null,"abstract":"In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.","PeriodicalId":221905,"journal":{"name":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Construction of high-rate QC-LDPC codes\",\"authors\":\"Xu Chen, F. Lau\",\"doi\":\"10.1109/ATC.2011.6027427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.\",\"PeriodicalId\":221905,\"journal\":{\"name\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATC.2011.6027427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATC.2011.6027427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文基于缩短阵列码,构造了周长为10的高速率拟循环低密度校验码。首先,我们得到了不同周长的缩短数组码的最大列数的分析结果。在此基础上,提出了一种针对列权三码的编码构造方法,并与传统的贪心构造算法进行了比较。我们证明了所提出的方法比传统的贪婪算法更有效,因为使用我们提出的方法构造的最小码长与使用贪婪构造的最小码长相当或短得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Construction of high-rate QC-LDPC codes
In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信