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}
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.
期刊介绍:
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.