LLR-based Successive Cancellation List Decoding of Polar Codes release_fljhwy27uzfkrhadkxjup2yzo4

by Alexios Balatsoukas-Stimming, Mani Bastani Parizi, Andreas Burg

Released as a article .

2015  

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% to 137% 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.
In text/plain format

Archived Files and Locations

application/pdf  661.1 kB
file_3kme5f5dv5f5bdso2jgpwthbqm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2015-03-06
Version   v4
Language   en ?
arXiv  1401.3753v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b02c209d-005a-418d-b127-b6d1fc0392ac
API URL: JSON