Low Complexity Early Stopping Belief Propagation Decoder for Polar Codes

Belief propagation is one of low latency decoding algorithms for polar codes but it requires relatively high decoding complexity due to its inherent iterative decoding nature. To remedy the problem, early stopping belief propagation algorithm was proposed. Unfortunately, it requires additional complexity to test stopping criterion at each end of decoder iterations. In this paper, we propose a low complexity early stopping belief propagation decoder for polar codes which requires lower complexities not only for stopping criterion test but also for decoding by reducing the number of message updates within the decoder without any performance loss.