Comparison of Windowed-Decoder Configurations for Spatially Coupled LDPC Codes Under Equal-Complexity Constraints

04/27/2020 ∙ by Janik Frenzel, et al. ∙ 0

Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes offer excellent decoding performance and can be elegantly decoded with a Windowed Decoder (WD). We determine an efficient WD configuration with low control overhead. For fair comparisons, we normalize all configurations to the same maximal computational complexity, which is an important measure of the decoding effort in packet-based data communication systems. We determine an optimized configuration from a joint evaluation of the window size, the window update strategy, and parity check-based Early Termination (ET). Firstly, we use a variable node-centered update strategy, which omits updates of messages in some parts of the decoding window. With the complexity normalization, the window size can be increased compared to a check node-centered update strategy, which uniformly updates all messages in the decoding window. Secondly, we only require the satisfaction of the top-most parity-check equations in each window to move to the next position more quickly. Using a surprisingly large window size, the resulting WD halves the average decoding complexity of the block decoder while maintaining a rather small gap in the decoding performance.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.