List Decoding of Polar Codes
arXiv:1206.0050
Abstract
We describe a successive-cancellation \emph{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 decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output. If the most likely codeword is selected, simulation results show that the resulting performance is very close to that of a maximum-likelihood decoder, even for moderate values of . Alternatively, if a "genie" is allowed to pick the codeword from the list, the results are comparable to the current state of the art LDPC codes. Luckily, implementing such a helpful genie is easy. Our list decoder doubles the number of decoding paths at each decoding step, and then uses a pruning procedure to discard all but the "best" paths. %In order to implement this algorithm, we introduce a natural pruning criterion that can be easily evaluated. Nevertheless, a straightforward implementation still requires time, which is in stark contrast with the 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 time and space.
References in corpus (1)
Cited by in corpus (8)
- Fast Polar Decoders: Algorithm and Implementation
- Low-latency List Decoding Of Polar Codes With Double Thresholding
- High Performance Error Correction for Quantum Key Distribution using Polar Codes
- An efficient length- and rate-preserving concatenation of polar and repetition codes
- Low-Latency Successive-Cancellation List Decoders for Polar Codes with Multi-bit Decision
- Successive Cancellation Decoding of Polar Codes using Stochastic Computing
- Polar Coded HARQ Scheme with Chase Combining
- Successive Cancellation List Polar Decoder using Log-likelihood Ratios