Name
Abstract | ||
|---|---|---|
Belief propagation (BP) algorithm of polar codes suffers from very high computational complexity when the iteration number becomes larger. In this paper, an early stopping criterion is proposed to avoid unnecessary iterations efficiently. The proposed only needs to detect whether the proportion of unchanged soft-output messages in a detection space exceeds a threshold. The proposed iteration can achieve a desired trade-off between complexity and decoding performance. Simulation results have shown that when the maximum iteration number is 40, the flooding BP (FO-BP) decoder with the proposed criterion can reduce 82.17% of iterations at 3.5dB compared with the FO-BP decoder without early stopping criterion. The proposed criterion costs Nl32 additions and Nl32 comparisons, where N indicates the code length, which effectively reduces the computational complexity. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ICSPCC.2018.8567778 | 2018 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC) |
Keywords | DocType | ISBN |
polar codes,belief propagation (BP),early stopping criterion,soft messages | Conference | 978-1-5386-7947-0 |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianming Cui | 1 | 1 | 0.39 |
| Jun Li | 2 | 1 | 0.39 |
| Yanfei Dong | 3 | 1 | 0.39 |
| Xiaojun Zhang | 4 | 11 | 1.22 |
| Qingtian Zeng | 5 | 242 | 43.67 |