Towards Practical Software Stack Decoding of Polar Codes
Information Theory
2018-09-12 v1 math.IT
Abstract
The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder.
Keywords
Cite
@article{arxiv.1809.03606,
title = {Towards Practical Software Stack Decoding of Polar Codes},
author = {Harsh Aurora and Warren J. Gross},
journal= {arXiv preprint arXiv:1809.03606},
year = {2018}
}