一种短长度LT码的自适应降周期编码方案

Xin Song, Yurong Liao, Dan Ding, Fei Teng
{"title":"一种短长度LT码的自适应降周期编码方案","authors":"Xin Song, Yurong Liao, Dan Ding, Fei Teng","doi":"10.1109/ICCSN.2018.8488218","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Adaptive Cycle Decrease Encoding Scheme for Short Length LT Codes\",\"authors\":\"Xin Song, Yurong Liao, Dan Ding, Fei Teng\",\"doi\":\"10.1109/ICCSN.2018.8488218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.\",\"PeriodicalId\":243383,\"journal\":{\"name\":\"2018 10th International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2018.8488218\",\"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 10th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2018.8488218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对二进制加性白高斯信道(BIAWGN)上的短长度LT码,提出了一种新的循环递减编码(CDE)方案。引入了两个阈值,用于减少lt码发生器矩阵中长度为4的循环数。在编码过程中,对循环次数超过阈值的信息节点进行连续筛选,降低了其参与后期编码过程的概率,改变了这些信息节点使用的度分布。导出了任意发生器矩阵的循环数的上界和下界。然后使用分析来计算阈值,使发电机矩阵中的循环次数急剧减少。仿真结果表明,在BIAWGN信道上,短长度CDE LT码($k= 50$和200 $)的性能优于传统的LT码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Adaptive Cycle Decrease Encoding Scheme for Short Length LT Codes
This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信