LLR-Based Successive Cancellation List Decoding of Polar Codes

DOI10.1109/TSP.2015.2439211zbMATH Open1394.94956arXiv1401.3753OpenAlexW2284321898MaRDI QIDQ4580833FDOQ4580833

Authors: Alexios Balatsoukas-Stimming, Mani Bastani Parizi, Andreas Burg 

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting step involved in successive cancellation list decoding. We propose a hardware architecture of the successive cancellation list decoder in the log-likelihood ratio domain which, compared to a log-likelihood domain implementation, requires less irregular and smaller memories. This simplification together with the gains in the metric sorter, lead to $56\mathrm{\%}$ to $137\mathrm{\%}$ higher throughput per unit area than other recently proposed architectures. We then evaluate the empirical performance of the CRC-aided successive cancellation list decoder at different list sizes using different CRCs and conclude that it is important to adapt the CRC length to the list size in order to achieve the best error-rate performance of concatenated polar codes. Finally, we synthesize conventional successive cancellation decoders at large block-lengths with the same block-error probability as our proposed CRC-aided successive cancellation list decoders to demonstrate that, while our decoders have slightly lower throughput and larger area, they have a significantly smaller decoding latency.

Full work available at URL: https://arxiv.org/abs/1401.3753

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Cited In (6)

• Design and decoding of polar codes with large kernels: a survey
• Efficient quantum key distribution protocol based on classical-quantum polarized channels
• A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
• Rate-adaptive reconciliation with polar coding for continuous-variable quantum key distribution
• Shannon-limit approached information reconciliation for quantum key distribution
• Recursive descriptions of polar codes

This page was built for publication: LLR-Based Successive Cancellation List Decoding of Polar Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580833)