Low-Complexity Decoder of Analog Fountain Codes for Industrial Internet of Things

In this paper, towards the ultra-reliable low-latency requirements of industrial Internet of Things (IIoT), we design a low decoding complexity ordered statistic decoder (OSD) for short analog fountain codes (S-AFCs). We first propose a concatenated decoder named soft-OSD (S-OSD) for S-AFCs, where t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE Vehicular Technology Conference s. 1 - 6
Hlavní autori: Zhang, Ke, Wang, Ye, Jiao, Jian, Lu, Rongxing, Zhang, Qinyu
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 24.06.2024
Predmet:
Complexity theory
Decoding
density evolution
discarding and stopping criterion
IIoT
Monte Carlo methods
Parity check codes
Reliability
short AFCs
Simulation
soft-ordered statistic decoder
Vehicular and wireless technologies
ISSN:2577-2465
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, towards the ultra-reliable low-latency requirements of industrial Internet of Things (IIoT), we design a low decoding complexity ordered statistic decoder (OSD) for short analog fountain codes (S-AFCs). We first propose a concatenated decoder named soft-OSD (S-OSD) for S-AFCs, where the S-AFCs are concatenated with LDPC codes. Then, we analyze the log-likelihood ratio (LLR) output of inner decoder via the density evolution (DE), the DE results provide the theoretical guidelines to design the discarding criterion (DC) of test error patterns (TEPs) and stopping criterion (SC) to lower the complexity of S-OSD. Simulation results show that the S-OSD can achieve the same error performance with existing decoding algorithms for S-AFCs, and the complexity of S-OSD is greatly decreased, in terms of the average re-encoding number of OSD and operations number per information bit.
ISSN:2577-2465
DOI:10.1109/VTC2024-Spring62846.2024.10683654