BibTeX
@MISC{Tal_1listdecoding,
author = {Ido Tal and Alexander Vardy},
title = {1List Decoding of Polar Codes},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, up to L decoding paths are considered concurrently at each decoding stage. Simulation results show that the resulting performance is very close to that of a maximum-likelihood decoder, even for moderate values of L. Thus it appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes. The specific list-decoding algorithm that achieves this perfor-mance doubles the number of decoding paths at each decoding step, and then uses a pruning procedure to discard all but the L “best ” paths. In order to implement this algorithm, we introduce a natural pruning criterion that can be easily evaluated. Never-theless, straightforward implementation still requires O(L · n2) time, which is in stark contrast with the O(n logn) complexity of the original successive-cancellation decoder. We utilize the structure of polar codes to overcome this problem. Specifically, we devise an efficient, numerically stable, implementation taking only O(L · n logn) time and O(L · n) space. I.
Keyphrases
polar code specific list-decoding algorithm resulting performance list decoder simulation result stark contrast original successive-cancellation decoder straightforward implementation maximum-likelihood decoding ar kan moderate value maximum-likelihood decoder successive-cancellation list decoder pruning procedure classic successive-cancellation decoder natural pruning criterion proposed list decoder
