Sliding Window Decoding for QC-SC-LDPC Codes Under the Constraint of Implementation Complexity

Abstract

Sliding window decoding has been employed as the decoding scheme of quasi-cyclic spatially-coupled low-density parity-check (QC-SC-LDPC) codes, with the decoding latency and complexity independent of the coupling length but proportional to the window size. The window size was empirically chosen at least three times the constraint length in previous works, which results in the preference of QC-SC-LDPC codes with small constraint length, to reduce the decoding latency and complexity in practical systems. However, the code design freedom and the decoder throughput are limited for these QC-SC-LDPC codes. In this paper, the optimal window size under the constraint of practical decoding complexity is analyzed employing multi-edge-type density evolution (MET-DE). It can be verified from the MET-DE analytical result that the optimal window size could achieve less than twice the constraint length for several edge spreading patterns, which largely loose this restriction in practical code design. Furthermore, it could be observed that besides the constraint length, the specific structure of the edge spreading pattern could affect the optimal window size as well, and thus the MET-DE analytical method for the optimal window size could effectively guide the design of QC-SC-LDPC codes in practical systems. Then an improved sliding window decoding scheme is proposed, including the optimal choice of window size and a parity-check based early termination scheme. Finally, the performance and robustness of the proposed sliding window decoding scheme for QC-SC-LDPC codes are demonstrated via simulation, with the decoding complexity at most twice as that of the conventional LDPC coded schemes.