Increasing the Speed of Polar List Decoders
arXiv:1407.2921 · doi:10.1109/SiPS.2014.6986089
Abstract
In this work, we present a simplified successive cancellation list decoder that uses a Chase-like decoding process to achieve a six time improvement in speed compared to successive cancellation list decoding while maintaining the same error-correction performance advantage over standard successive-cancellation polar decoders. We discuss the algorithm and detail the data structures and methods used to obtain this speed-up. We also propose an adaptive decoding algorithm that significantly improves the throughput while retaining the error-correction performance. Simulation results over the additive white Gaussian noise channel are provided and show that the proposed system is up to 16 times faster than an LDPC decoder of the same frame size, code rate, and similar error-correction performance, making it more suitable for use as a software decoding solution.
Submitted to the 2014 IEEE International Workshop on Signal Processing Systems (SiPS 2014)
Cited by in corpus (10)
- LLR-based Successive Cancellation List Decoding of Polar Codes
- Fast List Decoders for Polar Codes
- A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
- A High Throughput List Decoder Architecture for Polar Codes
- List Decoding of Arikan's PAC Codes
- Low-latency List Decoding Of Polar Codes With Double Thresholding
- BER Performance of Polar Coded OFDM in Multipath Fading
- A multi-mode area-efficient SCL polar decoder
- A hybrid partial sum computation unit architecture for list decoders of polar codes
- Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction