A Modified Successive-Cancellation Stack Polar Decoder

DOI

10.2991/icecee-15.2015.45How to use a DOI?

Keywords

Algorithm reformulation; Stack decoding; Polar codes; Successive cancellation (SC).

Abstract

Polar codes represent an emerging correcting codes with power to approach the capacity of a discrete memoryless channel. However, the decoding performance of polar codes with traditional successive cancellation (SC) algorithm cannot match that of the low-density parity-check or Turbo codes. In this paper, a modified successive cancellation stack (MSCS) polar decoder is proposed. Unlike the original SC stack polar (SCS) decoders, we propose a modified path that can significantly reduce latency of SCS decoders. Simulation results in the binary-input additive white Gaussian noise channel show that modified algorithm has the slightly performance as the SCS algorithm. Moreover, the time and space complexity of the MSCS decoder is much lower than that of the SCS and can be very close to that of the SC in the high SNR regime.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chun Li
AU  - Xinhai Tong
PY  - 2015/06
DA  - 2015/06
TI  - A Modified Successive-Cancellation Stack Polar Decoder
BT  - Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics
PB  - Atlantis Press
SP  - 199
EP  - 202
SN  - 2352-538X
UR  - https://doi.org/10.2991/icecee-15.2015.45
DO  - 10.2991/icecee-15.2015.45
ID  - Li2015/06
ER  -