Paper Info
Title
Fast List Decoders for Polar Codes
Abstract
Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower than SC decoding itself, by an order of magnitude in practical implementations. In this paper, we present a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software. Furthermore, we show that for software-defined radio applications, our proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature while offering comparable error-correction performance at similar or shorter code lengths.
Year
DOI
Venue
2016
10.1109/JSAC.2015.2504299
IEEE Journal on Selected Areas in Communications
Keywords
Field
DocType
Decoding,Software algorithms,Software,Parity check codes,Complexity theory,Reliability,Hardware
Concatenated error correction code,Sequential decoding,Low-density parity-check code,Computer science,Serial concatenated convolutional codes,Parallel computing,Turbo code,Real-time computing,Polar code,Linear code,List decoding
Journal
Volume
Issue
ISSN
34
2
0733-8716
Citations 
PageRank 
References 
32
1.16
22
Authors
5
Name
Order
Citations
PageRank
Gabi Sarkis125317.23
Pascal Giard224417.57
Alexander Vardy32736272.53
Claude Thibeault410714.35
Warren J. Gross51106113.38