Low Complexity List Successive Cancellation Decoding of Polar Codes

TL;DR

This paper introduces a low complexity list successive cancellation decoding algorithm for polar codes that reduces computational effort by classifying bit reliability and selectively applying SC or LSC decoding, maintaining performance.

Contribution

The paper presents a novel LCLSC decoding method that adaptively switches between SC and LSC decoding based on reliability thresholds to lower complexity while preserving decoding performance.

Findings

Complexity significantly lower than traditional LSC decoding

Performance close to LSC decoding in low code rate regions

Effective reliability classification improves decoding efficiency

Abstract

We propose a low complexity list successive cancellation (LCLSC) decoding algorithm to reduce complexity of traditional list successive cancellation (LSC) decoding of polar codes while trying to maintain the LSC decoding performance at the same time. By defining two thresholds, namely "likelihood ratio (LR) threshold" and "Bhattacharyya parameter threshold", we classify the reliability of each received information bit and the quality of each bit channel. Based on this classification, we implement successive cancellation (SC) decoding instead of LSC decoding when the information bits from "bad" subchannels are received reliably and further attempt to skip LSC decoding for the rest information bits in order to achieve a lower complexity compared to full LSC decoding. Simulation results show that the complexity of LCLSC decoding is much lower than LSC decoding and can be close to that of SC decoding, especially in low code rate regions.