Towards Practical Software Stack Decoding of Polar Codes
arXiv:1809.03606
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.
References in corpus (6)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- LLR-based Successive Cancellation List Decoding of Polar Codes
- Fast Polar Decoders: Algorithm and Implementation
- Improved Successive Cancellation Decoding of Polar Codes
- Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes
- Fast Sequential Decoding of Polar Codes