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.

Authors

Institutions

Publication Details

Journal
IEEE Open Journal of the Communications Society
Published
2025-01-01
DOI
https://doi.org/10.1109/ojcoms.2025.3573437
Citations
1
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Over-the-Air Multi-User Convolutional Code for URLLC

Atílio Gameiro, Adão Silva, Daniel Castanheira, Rafael Santos
1 citations
IEEE Open Journal of the Communications Society
Algorithms and Data Compression
article

An Over-the-Air Multi-User Convolutional Code for URLLC

Atílio Gameiro, Adão Silva, Daniel Castanheira, Rafael Santos
article en
1 citations

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.

IEEE Open Journal of the Communications SocietyVol. 6
Instituto de Telecomunicações (PT)
Fundação para a Ciência e a Tecnologia
Openalex Percentile: Top 95%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.