Wiley eBooks
List Decoding of Polar Codes
Mohammad Rowshan, Emanuele Viterbo
Abstract
To address the weaknesses of successive cancellation (SC) decoding, this chapter explores enhanced algorithms that follow multiple paths in the decoding tree. These decoders, known as successive cancelation list (SCL) decoders, retain the recursive structure of SC decoding while improving its performance by considering several distinct solutions. The chapter delves into both parallel and serial implementations of SCL decoders, highlighting their fundamental structures and trade-offs. It helps the readers to gain an understanding of the fundamental principles behind SC list decoders and learn how to exploit the structural properties of polar codes to enhance decoding efficiency. The SCL decoding algorithm scans the binary tree (in the case of binary codes) by following more than one path at a time. That is, a number of paths are followed in parallel. The chapter review different strategies for additional decoding attempts in an iterative manner for the SC and SCL decoding algorithms.