Abstract | ||
---|---|---|
Polar codes based on $2times2$ non-binary kernels are discussed in this work. The kernel over $text{GF}(q)$ is selected by maximizing the polarization effect and using Monte-Carlo simulation. Belief propagation (BP) and successive cancellation (SC) based decoding algorithms are extended to non-binary codes. Additionally, a successive cancellation list (SCL) decoding with a pruned tree is proposed. Simulation results show that the proposed decoder performs very close to a conventional SCL decoder with significantly lower complexity. |
Year | Venue | Field |
---|---|---|
2018 | international symposium on turbo codes and iterative information processing | Computer science,Algorithm,Polar,Decoding methods,Binary number |
DocType | Volume | Citations |
Journal | abs/1807.03767 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Peihong Yuan | 1 | 3 | 0.71 |
Fabian Steiner | 2 | 65 | 11.68 |