Partitioned Successive-Cancellation List Decoding of Polar Codes
arXiv:1512.03128 · doi:10.1109/ICASSP.2016.7471817
Abstract
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional SCL algorithm. The decoder tree is broken into partitions that are decoded separately. We show that with careful selection of list sizes and number of partitions, the proposed algorithm can outperform conventional SCL while requiring less memory.
4 pages, 6 figures, to appear at IEEE ICASSP 2016
Cited by in corpus (7)
- Ordered Reliability Bits Guessing Random Additive Noise Decoding
- Partitioned Successive-Cancellation Flip Decoding of Polar Codes
- Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
- Scaling Deep Learning-based Decoding of Polar Codes via Partitioning
- Segmented Successive Cancellation List Polar Decoding with Tailored CRC
- A Complexity Reduction Method for Successive Cancellation List Decoding
- On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes