Partitioned successive-cancellation list decoding of polar codes

Seyyed Ali Hashemi; Alexios Balatsoukas-Stimming; Pascal Giard; Claude Thibeault; Warren J. Gross

ICASSP 2016accepted0 citations

Partitioned successive-cancellation list decoding of polar codes

Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming, Pascal Giard, Claude Thibeault, Warren J. Gross

Abstract

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional SCL algorithm. The decoder tree is broken into partitions that are decoded separately. We show that with careful selection of list sizes and number of partitions, the proposed algorithm can outperform conventional SCL while requiring less memory.

BibTeX

@inproceedings{icassp2016_partitionedsucce,
  title = {Partitioned successive-cancellation list decoding of polar codes},
  author = {Seyyed Ali Hashemi and Alexios Balatsoukas-Stimming and Pascal Giard and Claude Thibeault and Warren J. Gross},
  booktitle = {ICASSP 2016},
  year = {2016}
}