Journal of Xidian University ›› 2020, Vol. 47 ›› Issue (3): 128-134.doi: 10.19665/j.issn1001-2400.2020.03.018

Previous Articles    

Sliding window decoding algorithm for spatially coupled LDPC codes with a variable window

ZHANG Yamei1,2,ZHOU Lin1,2(),CHEN Chen1,GUO Rongxin1,HE Yucheng1,2   

  1. 1. Xiamen Key Laboratory of Mobile Multimedia Communications, Huaqiao University, Xiamen 361021, China
    2. State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
  • Received:2019-12-20 Online:2020-06-20 Published:2020-06-19
  • Contact: Lin ZHOU E-mail:linzhou@hqu.edu.cn

Abstract:

Spatially coupled low density parity check (SC-LDPC) codes can achieve a better decoding performance with a small message recovery latency due to the sliding window decoding. An improved decoding scheme based on window extension is proposed for further enhancing the performance of the sliding window decoding. In contrast to conventional sliding window decoding, the window size of this scheme can vary according to the average logarithmic likelihood ratio (LLR) value of the target symbol. Specifically, for every iteration in the decoding process, we compare the average LLR value of the target symbol with the preset threshold. If the average LLR value of the target symbol is less than the preset threshold and the current window size does not exceed the maximum size, the decoding window size adds one and then performs a new iteration with the new window size. By this means, the scheme can achieve trade-off between decoding performance, complexity and latency. Simulation results on the additive white Gaussian noise (AWGN) channel show that this scheme can significantly improve the sliding window decoding performance of SC-LDPC codes.

Key words: spatially coupled low density parity check codes, sliding window decoding, window extension

CLC Number: 

  • TN911.22

Baidu
map