基于Raptor代码的无源随机访问与协调树-Raptor解码算法

Dexia Jiang, Pingzhi Fan
{"title":"基于Raptor代码的无源随机访问与协调树-Raptor解码算法","authors":"Dexia Jiang, Pingzhi Fan","doi":"10.1109/ICCCWorkshops57813.2023.10233821","DOIUrl":null,"url":null,"abstract":"The widespread applications of the Internet of Things (IoT) have brought about explosive growth in the number of IoT devices. A new grant-free random access paradigm called unsourced random access (URA) provides a new direction for massive Machine Type Communication (mMTC), especially when users do not need to identify themselves. This paper presents a Raptor code based URA over additive white Gaussian noise (AWGN) channels. In this scheme, the messages of each active user are encoded with fixed-rate standardized RaptorQ code to generate a block of coded symbols, followed by tree code and sparse regression code (SPARCs). Furthermore, at receiver, a coordinated tree-Raptor decoding algorithm is designed to realize the coded fragments stitching and to further enhance the transmission reliability. Simulation results show that the new scheme performs well, especially when the number of active users is large, compared with the related URA schemes.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Raptor Code Based Unsourced Random Access with Coordinated Tree-Raptor Decoding Algorithm\",\"authors\":\"Dexia Jiang, Pingzhi Fan\",\"doi\":\"10.1109/ICCCWorkshops57813.2023.10233821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The widespread applications of the Internet of Things (IoT) have brought about explosive growth in the number of IoT devices. A new grant-free random access paradigm called unsourced random access (URA) provides a new direction for massive Machine Type Communication (mMTC), especially when users do not need to identify themselves. This paper presents a Raptor code based URA over additive white Gaussian noise (AWGN) channels. In this scheme, the messages of each active user are encoded with fixed-rate standardized RaptorQ code to generate a block of coded symbols, followed by tree code and sparse regression code (SPARCs). Furthermore, at receiver, a coordinated tree-Raptor decoding algorithm is designed to realize the coded fragments stitching and to further enhance the transmission reliability. Simulation results show that the new scheme performs well, especially when the number of active users is large, compared with the related URA schemes.\",\"PeriodicalId\":201450,\"journal\":{\"name\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

物联网(IoT)的广泛应用带来了物联网设备数量的爆炸式增长。一种新的无授权随机访问范式被称为无源随机访问(URA),为大规模机器类型通信(mMTC)提供了一个新的方向,特别是当用户不需要识别自己时。本文提出了一种基于加性高斯白噪声(AWGN)信道的Raptor代码的URA算法。在该方案中,对每个活跃用户的消息进行固定速率的标准化RaptorQ编码,生成一个编码符号块,然后是树码和稀疏回归码(SPARCs)。在接收端,设计了协调的tree-Raptor解码算法,实现了编码片段的拼接,进一步提高了传输的可靠性。仿真结果表明,与现有的市区重建局方案相比,新方案具有良好的性能,特别是在活跃用户数量较大的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Raptor Code Based Unsourced Random Access with Coordinated Tree-Raptor Decoding Algorithm
The widespread applications of the Internet of Things (IoT) have brought about explosive growth in the number of IoT devices. A new grant-free random access paradigm called unsourced random access (URA) provides a new direction for massive Machine Type Communication (mMTC), especially when users do not need to identify themselves. This paper presents a Raptor code based URA over additive white Gaussian noise (AWGN) channels. In this scheme, the messages of each active user are encoded with fixed-rate standardized RaptorQ code to generate a block of coded symbols, followed by tree code and sparse regression code (SPARCs). Furthermore, at receiver, a coordinated tree-Raptor decoding algorithm is designed to realize the coded fragments stitching and to further enhance the transmission reliability. Simulation results show that the new scheme performs well, especially when the number of active users is large, compared with the related URA schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信