English

Symbol-Index-Feedback Polar Coding Schemes for Low-Complexity Devices

Information Theory 2012-11-19 v2 math.IT

Abstract

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have low-complexity encoding algorithms. Therefore, these codes are favorable choices for low-complexity devices, for example, in ubiquitous computing and sensor networks. However, the polar codes fall short in terms of finite-length error probabilities, compared with the state-of-the-art codes, such as the low-density parity-check codes. In this paper, in order to improve the error probabilities of the polar codes, we propose novel interactive coding schemes using receiver feedbacks based on polar codes. The proposed coding schemes have very low computational complexities at the transmitter side. By experimental results, we show that the proposed coding schemes achieve significantly lower error probabilities.

Keywords

Cite

@article{arxiv.1201.1462,
  title  = {Symbol-Index-Feedback Polar Coding Schemes for Low-Complexity Devices},
  author = {Xudong Ma},
  journal= {arXiv preprint arXiv:1201.1462},
  year   = {2012}
}

Comments

Accepted for publication in the Proceedings of the International Conference on Computing, Networking and Communications 2013, San Diego, USA, January 28-31, 2013

R2 v1 2026-06-21T20:01:24.088Z