arrow
Return

Simplified Fast List PAC Decoder for Broadcasting Services in 6G: Algorithm and Implementation

delete2025-06-01
delete0
PRE
AI
J
Jingxin Dai
H
Hang Yin
Y
Yansong Lv
Y
Yuhuan Wang
Y
Yin Xu
R
Rui Lv
DOI:10.1109/TBC.2025.3534624delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In the 6G network, integrating broadcasting and mobile networks will significantly improve the transmission capability. Considering the excellent error-correction performance, polarized-adjusted convolutional (PAC) codes are promising for ensuring reliable data transmission in 6G broadcasting services. However, the inherent high decoding latency of PAC codes poses challenges for seamless switching between broadcasting and mobile services. In this paper, we propose a simplified fast list (SFL) PAC decoder, which jointly exploits the node thresholds and adaptive path-pruning technology to reduce the decoding latency while maintaining high reliability. Firstly, we present a novel path expansion rule based on the node thresholds to avoid unnecessary computations. Secondly, the introduction of the adaptive path-pruning technology efficiently reduces the number of sorting operations. Moreover, we implement the proposed decoder on general purpose processors (GPPs) by software. Simulation results show that the proposed SFL decoding algorithm significantly reduces the decoding latency by up to 75.18% compared to the state-of-the-art (SOTA) work with no noticeable degradation in error-correction performance. Software implementation of the proposed decoder achieves an 18.80% improvement in throughput performance over the SOTA PAC software decoder.
Keywords:
PAC codes
broadcasting
decoding latency
threshold
decoder
software

Journal

IEEE Transactions on Broadcasting cover
IEEE Transactions on Broadcasting
IF:
4.8
Papers:
2.1K
Citations:
3.0K

Organization

S
shanghai jiao tong university
Scholars:
15.6W
Papers: 11.6W
Citations: 159
C
Communication University of China
Scholars:
1.1K
Papers: 820
Citations: 326