.png){kind=icon}
.png){kind=icon}
Return
Low Complexity Generalized-LDPC Decoder Based on Trellis Splicing
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3035200.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The high reliability short length low-density parity-check (LDPC) codes for Ultra Reliable Low Latency Communication (URLLC) are particularly important to future wireless communication systems. Even though the error floor region performance can be improved by using generalized-LDPC (G-LDPC) decoder, its penalty of increasing complexity can not be ignored. In this letter, we invoke the early stop criterion and the trellis splicing (TS) method to G-LDPC decoder. Hence, a G-LDPC-TS decoder is proposed. The proposed method can effectively reduce the number of variable nodes (VNs) involved in BCJR (Bahl-Cocke-Jelinek-Raviv) decoding of G-LDPC; thus, it yields a lower computational complexity. The results confirm that our G-LDPC-TS decoder can achieve a significant complexity reduction without sacrificing the performance.
Keywords:
Decoding
Splicing
Maximum likelihood decoding
Iterative decoding
Computational complexity
Reliability engineering
Error analysis
Generalized-LDPC (G-LDPC) decoder
error floor region
trapping sets
early stop criterion
trellis splicing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W