Efficient Sliding Window Decoding of Spatially Coupled LDPC Codes for Broadcasting
Zhitong He, Kewu Peng, Jian Song, Yushu Zhang
Abstract
Zhitong He, Kewu Peng, Jian Song, Yushu Zhang
Abstract
Spatially-coupled low-density parity-check (SCLDPC) codes, which are capable of universally achieving capacity over different channels, could be a potential candidate of error control channel codes employed in flexible transmission schemes for future broadcasting systems. Sliding window decoding is believed the preferred decoding method for SC-LDPC codes, due to its lower decoding latency and complexity compared to conventional full belief propagation (BP) decoding, and is studied in this paper for SC-LDPC codes under broadcasting scenario. More specially, the optimal window size for sliding window decoding is investigated in this paper to improve the decoding performance under practical constraints of decoding complexity and latency in broadcasting systems. The early termination strategies are also considered to further reduce the decoding complexity. Finally, simulation results are presented, which demonstrate that the proposed sliding window decoding method has decoding complexity comparable to conventional LDPC decoding and shows consistent excellent decoding performance.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Spatially-coupled low-density parity-check (SCLDPC) codes, which are capable of universally achieving capacity over different channels, could be a potential candidate of error control channel codes employed in flexible transmission schemes for future broadcasting systems. Sliding window decoding is believed the preferred decoding method for SC-LDPC codes, due to its lower decoding latency and complexity compared to conventional full belief propagation (BP) decoding, and is studied in this paper for SC-LDPC codes under broadcasting scenario. More specially, the optimal window size for sliding window decoding is investigated in this paper to improve the decoding performance under practical constraints of decoding complexity and latency in broadcasting systems. The early termination strategies are also considered to further reduce the decoding complexity. Finally, simulation results are presented, which demonstrate that the proposed sliding window decoding method has decoding complexity comparable to conventional LDPC decoding and shows consistent excellent decoding performance.
Key concepts: Decoding methods, Low-density parity-check code, Sliding window protocol, List decoding, Sequential decoding, Computer science, Berlekamp–Welch algorithm, Algorithm