LLR-based Successive Cancellation List Decoding of Polar Codes

We present an LLR-based implementation of the successive cancellation list (SCL) decoder. To this end, we associate each decoding path with a metric which (i) is a monotone function of the path’s likelihood and (ii) can be computed efficiently from the channel LLRs. The LLR-based formulation leads to a more efficient hardware implementation of the decoder compared to the known log-likelihood based implementation. Synthesis results for an SCL decoder with block-length of N = 1024 and list sizes of L = 2 and L = 4 confirm that the LLR-based decoder has considerable area and operating frequency advantages in the orders of 50% and 30%, respectively.


Published in:
2014 Ieee International Conference On Acoustics, Speech And Signal Processing (Icassp)
Presented at:
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2014), Florence, Italy, May 4-9, 2014
Year:
2014
Publisher:
New York, Ieee
ISSN:
1520-6149
ISBN:
978-1-4799-2893-4
Keywords:
Laboratories:




 Record created 2014-04-09, last modified 2018-09-13

Preprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)