List Decoding of Polar Codes
Technion – Israel Institute of Technology · University of California, San Diego
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, L decoding paths are considered concurrently at each decoding stage, where L is an integer parameter. At the end of the decoding process, the most likely among the L paths is selected as the single codeword at the decoder output. Simulations show that the resulting performance is very close to that of maximum-likelihood decoding, even for moderate values of L. Alternatively, if a genie is allowed to pick the transmitted codeword from the list, the results are comparable with the performance of current state-of-the-art LDPC codes.…
Citation impact
- FWCI
- 127.97
- Percentile
- 100%
- References
- 15
Authors
2Topics & keywords
- Decoding methods
- List decoding
- Computer science
- Code word
- Algorithm
- Sequential decoding
- Soft-decision decoder
- Integer (computer science)