Variable Sliding Window Algorithm Based on Scaling Factor

This study focuses on improving the traditional sliding window decoding algorithm. To address the issue of decoding error correction performance degradation caused by truncated parity-check information in the sliding window algorithm, the authors propose dynamic adjustments to the window size at different time instances based on the modified parity-check relationship introduced in their previous work. These adjustments aim to enhance the integrity of the information and parity-check relationships within the window. Additionally, a correction factor is employed to modify the information passed by the window to the marginal processor. These targeted modifications alter the window structure, achieving overall performance improvement at the cost of a slight increase in complexity. Simulation results demonstrate that, for both medium-short and long codewords, a performance gain of 0.2–0.25 dB can be achieved at a BER level of 1E-4.