一种用于URLLC的无线多用户卷积码

IF 6.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Rafael Santos;Daniel Castanheira;Adão Silva;Atílio Gameiro
{"title":"一种用于URLLC的无线多用户卷积码","authors":"Rafael Santos;Daniel Castanheira;Adão Silva;Atílio Gameiro","doi":"10.1109/OJCOMS.2025.3573437","DOIUrl":null,"url":null,"abstract":"URLLC applications impose stringent latency and reliability requirements, making its compliance challenging due to the inherent trade-off between them. These applications typically involve the exchange of small information blocks. Convolutional codes (CC) exhibit near-optimal performance when encoding short blocks. To enable packet-based transmissions, CCs require some kind of termination. A zero-terminated CC (ZTCC) enables efficient maximum likelihood (ML) decoding through the Viterbi algorithm, but suffers from a rate-loss particularly prominent in short blocks. A tail-biting CC (TBCC) avoids rate-loss but entails significantly higher ML decoding complexity. Despite the ZTCC having lower ML decoding complexity and similar error performance, TBCC has received preference by wireless standards, essentially due to ZTCC rate-loss. This work proposes a novel distributed multi-user ZTCC (MU-ZTCC) coding scheme, which eliminates rate-loss by encoding multiple physically separated users over-the-air. Local user data undergoes standard ZTCC encoding followed by multi-user encoding via over-the-air summation. Due to its zero termination, ML decoding of MU-ZTCC is accomplished with a single Viterbi execution. Simulation results show that MU-ZTCC approaches the performance of orthogonal transmissions as SNR increases, while increasing the transmission rate by up to 47% for the selected parameters. This scheme can be viewed as a non-orthogonal multiple access scheme, whose structure enables ML joint detection and decoding with the complexity of standard Viterbi algorithm.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4718-4730"},"PeriodicalIF":6.3000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11015616","citationCount":"0","resultStr":"{\"title\":\"An Over-the-Air Multi-User Convolutional Code for URLLC\",\"authors\":\"Rafael Santos;Daniel Castanheira;Adão Silva;Atílio Gameiro\",\"doi\":\"10.1109/OJCOMS.2025.3573437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"URLLC applications impose stringent latency and reliability requirements, making its compliance challenging due to the inherent trade-off between them. These applications typically involve the exchange of small information blocks. Convolutional codes (CC) exhibit near-optimal performance when encoding short blocks. To enable packet-based transmissions, CCs require some kind of termination. A zero-terminated CC (ZTCC) enables efficient maximum likelihood (ML) decoding through the Viterbi algorithm, but suffers from a rate-loss particularly prominent in short blocks. A tail-biting CC (TBCC) avoids rate-loss but entails significantly higher ML decoding complexity. Despite the ZTCC having lower ML decoding complexity and similar error performance, TBCC has received preference by wireless standards, essentially due to ZTCC rate-loss. This work proposes a novel distributed multi-user ZTCC (MU-ZTCC) coding scheme, which eliminates rate-loss by encoding multiple physically separated users over-the-air. Local user data undergoes standard ZTCC encoding followed by multi-user encoding via over-the-air summation. Due to its zero termination, ML decoding of MU-ZTCC is accomplished with a single Viterbi execution. Simulation results show that MU-ZTCC approaches the performance of orthogonal transmissions as SNR increases, while increasing the transmission rate by up to 47% for the selected parameters. This scheme can be viewed as a non-orthogonal multiple access scheme, whose structure enables ML joint detection and decoding with the complexity of standard Viterbi algorithm.\",\"PeriodicalId\":33803,\"journal\":{\"name\":\"IEEE Open Journal of the Communications Society\",\"volume\":\"6 \",\"pages\":\"4718-4730\"},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2025-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11015616\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Open Journal of the Communications Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11015616/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11015616/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

URLLC应用程序施加了严格的延迟和可靠性要求,由于它们之间固有的权衡,使得其遵从性具有挑战性。这些应用程序通常涉及小信息块的交换。卷积码(CC)在编码短块时表现出近乎最佳的性能。为了实现基于分组的传输,cc需要某种形式的终止。零端CC (ZTCC)通过Viterbi算法实现高效的最大似然(ML)解码,但在短块中遭受速率损失尤其突出。咬尾CC (TBCC)避免了速率损失,但需要更高的ML解码复杂性。尽管ZTCC具有较低的ML解码复杂性和类似的错误性能,TBCC仍然受到无线标准的青睐,这主要是由于ZTCC的速率损失。本工作提出了一种新的分布式多用户ZTCC (MU-ZTCC)编码方案,该方案通过对多个物理上分离的用户进行无线编码来消除速率损失。本地用户数据经过标准的ZTCC编码,然后通过无线求和进行多用户编码。由于其零终止,MU-ZTCC的ML解码是通过单个Viterbi执行完成的。仿真结果表明,随着信噪比的增加,MU-ZTCC接近正交传输性能,同时在所选参数下,传输速率可提高47%。该方案可以看作是一种非正交多址方案,其结构使ML联合检测和解码具有标准Viterbi算法的复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Over-the-Air Multi-User Convolutional Code for URLLC
URLLC applications impose stringent latency and reliability requirements, making its compliance challenging due to the inherent trade-off between them. These applications typically involve the exchange of small information blocks. Convolutional codes (CC) exhibit near-optimal performance when encoding short blocks. To enable packet-based transmissions, CCs require some kind of termination. A zero-terminated CC (ZTCC) enables efficient maximum likelihood (ML) decoding through the Viterbi algorithm, but suffers from a rate-loss particularly prominent in short blocks. A tail-biting CC (TBCC) avoids rate-loss but entails significantly higher ML decoding complexity. Despite the ZTCC having lower ML decoding complexity and similar error performance, TBCC has received preference by wireless standards, essentially due to ZTCC rate-loss. This work proposes a novel distributed multi-user ZTCC (MU-ZTCC) coding scheme, which eliminates rate-loss by encoding multiple physically separated users over-the-air. Local user data undergoes standard ZTCC encoding followed by multi-user encoding via over-the-air summation. Due to its zero termination, ML decoding of MU-ZTCC is accomplished with a single Viterbi execution. Simulation results show that MU-ZTCC approaches the performance of orthogonal transmissions as SNR increases, while increasing the transmission rate by up to 47% for the selected parameters. This scheme can be viewed as a non-orthogonal multiple access scheme, whose structure enables ML joint detection and decoding with the complexity of standard Viterbi algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
13.70
自引率
3.80%
发文量
94
审稿时长
10 weeks
期刊介绍: The IEEE Open Journal of the Communications Society (OJ-COMS) is an open access, all-electronic journal that publishes original high-quality manuscripts on advances in the state of the art of telecommunications systems and networks. The papers in IEEE OJ-COMS are included in Scopus. Submissions reporting new theoretical findings (including novel methods, concepts, and studies) and practical contributions (including experiments and development of prototypes) are welcome. Additionally, survey and tutorial articles are considered. The IEEE OJCOMS received its debut impact factor of 7.9 according to the Journal Citation Reports (JCR) 2023. The IEEE Open Journal of the Communications Society covers science, technology, applications and standards for information organization, collection and transfer using electronic, optical and wireless channels and networks. Some specific areas covered include: Systems and network architecture, control and management Protocols, software, and middleware Quality of service, reliability, and security Modulation, detection, coding, and signaling Switching and routing Mobile and portable communications Terminals and other end-user devices Networks for content distribution and distributed computing Communications-based distributed resources control.
×
引用
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学术官方微信