.png){kind=icon}
Return
A Low-Complexity Parallel Hybrid Decoder for Primitive Rateless Codes
.png){kind=icon}
OA
AI
DOI：10.1109/tcomm.2026.3706481.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a parallel hybrid decoder for decoding primitive rateless (PR) codes. The proposed decoder integrates multiple-bases belief propagation (MBBP) with low-order ordered-statistics decoding (OSD), effectively reducing the complexity associated with high-order OSD, especially for low-rate codes operating in low signal-to-noise ratio (SNR) regimes. We evaluate the block error rate (BLER) performance of the decoder and propose an optimization method using a genetic algorithm to generate diverse parity-check matrices that further minimize the BLER. Simulation results demonstrate that PR codes decoded with the proposed low-complexity parallel hybrid decoder achieve performance very close to the normal approximation (NA) benchmark. PR codes, being adaptable to any desired length and rate, coupled with the proposed decoder, emerge as a promising solution for short-packet communication scenarios demanding stringent latency and reliability.
Keywords:
Multiple bases belief propagation
ordered-statistics decoding
primitive rateless codes
short blocklength regime
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
View more organizations
Cited Papers
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check MatrixOAAI
.png){kind=icon}
OAAIShareSave
View more