Sliding window protocol

Error detection and correction

Mathematics

Bit error rate

Low-density parity-check code

Operating system

Algorithm

Statistics

Berlekamp–Welch algorithm

Mathematical analysis

Coding (social sciences)

Block code

Sequential decoding

Variable (mathematics)

List decoding

Window (computing)

Computer science

Error floor

Real-time computing

Decoding methods

Coding gain

Concatenated error correction code

IEEE Communications Letters

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.

Adaptive Decoding Algorithm With Variable Sliding Window for Double SC-LDPC Coding System