Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

Peter Trifonov

Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

Information Theory 2020-12-16 v1 math.IT

Authors: Peter Trifonov

Abstract

Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes. Performance comparison with Arikan PAC and LDPC codes is provided. Furthermore, complete description of the decoding algorithm is presented.

Keywords

polar codes decoding algorithm

Cite

@article{arxiv.2012.08139,
  title  = {Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm},
  author = {Peter Trifonov},
  journal= {arXiv preprint arXiv:2012.08139},
  year   = {2020}
}

Related papers

View all related →