高周长QC-LDPC码结构的模拟退火方法

V. Usatyuk, I. Vorobyev
{"title":"高周长QC-LDPC码结构的模拟退火方法","authors":"V. Usatyuk, I. Vorobyev","doi":"10.1109/TSP.2018.8441303","DOIUrl":null,"url":null,"abstract":"We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes\",\"authors\":\"V. Usatyuk, I. Vorobyev\",\"doi\":\"10.1109/TSP.2018.8441303\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.\",\"PeriodicalId\":383018,\"journal\":{\"name\":\"2018 41st International Conference on Telecommunications and Signal Processing (TSP)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 41st International Conference on Telecommunications and Signal Processing (TSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSP.2018.8441303\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2018.8441303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

提出了一种构造高周长准循环低密度奇偶校验码的模拟退火方法。该方法适用于正则和不规则原型码。与先前描述的爬坡和改进的PEG方法相比,该方法在最小循环尺寸方面有所改进。仿真结果验证了采用5G eMBB标准长度自适应方法在基图2 (BG2)下误差层区域的性能增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes
We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信