pith. sign in

arxiv: 1501.01706 · v1 · pith:UILB76P4new · submitted 2015-01-08 · 💻 cs.IT · math.IT

Error Performance Analysis of the Symbol-Decision SC Polar Decoder

classification 💻 cs.IT math.IT
keywords algorithmsymbol-decisioncodeserrorperformancepolaranalysisbetter
0
0 comments X
read the original abstract

Polar codes are the first provably capacity-achieving forward error correction codes. To improve decoder throughput, the symbol-decision SC algorithm makes hard-decision for multiple bits at a time. In this paper, we prove that for polar codes, the symbol-decision SC algorithm is better than the bit-decision SC algorithm in terms of the frame error rate (FER) performance because the symbol-decision SC algorithm performs a local maximum likelihood decoding within a symbol. Moreover, the bigger the symbol size, the better the FER performance. Finally, simulation results over both the additive white Gaussian noise channel and the binary erasure channel confirm our theoretical analysis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.