.png){kind=icon}
.png){kind=icon}
Return
Adaptive Decoding Algorithm With Variable Sliding Window for Double SC-LDPC Coding System
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3222560.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, an adaptive decoding algorithm with a variable sliding window for joint source-channel coding (JSCC) scheme based on double spatially coupled low-density parity-check (DSC-LDPC) codes is investigated. For the traditional sliding window decoding (SWD) algorithm, one or more errors occurring in a decoding window may affect the decoding of the next window, which will trigger error propagation. To mitigate the effects, a window extension algorithm based on average log-likelihood ratios (LLRs) will be proposed, but the implement of extension implies higher decoding complexity. In order to trade-off the error rate performance and complexity, the source and channel threshold that determines the window extension are analyzed. In the simulation, the proposed SWD algorithm with acceptable complexity has better error rate performance in the water fall region and the error floor region.
Keywords:
Decoding
Encoding
Codes
Symbols
Complexity theory
Channel coding
Iterative decoding
JSCC
SC-LDPC
sliding window decoding
window extension
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W