English

Recursive Descriptions of Polar Codes

Information Theory 2015-06-19 v3 Hardware Architecture math.IT

Abstract

Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arikan's standard polar codes and for arbitrary polarizing kernels.

Keywords

Cite

@article{arxiv.1209.4818,
  title  = {Recursive Descriptions of Polar Codes},
  author = {Noam Presman and Simon Litsyn},
  journal= {arXiv preprint arXiv:1209.4818},
  year   = {2015}
}
R2 v1 2026-06-21T22:09:03.270Z