Wiley eBooks
Fast SC‐Based Decoding
Mohammad Rowshan, Emanuele Viterbo
Abstract
This chapter explores various special nodes that correspond to constituent codes depending on the arrangement of frozen bits. It further generalizes these nodes and demonstrates their application in successive cancellation (SC) list decoding, while noting that they can also enhance the efficiency of any SC-based decoding algorithm, including sequential decoding. To generalize SC decoding, the chapter provides a framework for decoding polar codes via their constituent codes. It provides an overview of rate-0 node, rate-C node, repetition nodes, and parity check nodes. In order to reduce complexity, the SC decoder was simplified by Alamdar-Yazdi and Kschischang to decode the rate-1 constituent codes of polar codes locally without any negative impact on the block error rate. This simplification was extended to single parity constituent codes based on the Wagner rule and repetition codes by Sarkis et al.