Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912432699473920 |
|---|---|
| author | Jia, Chenyuan Chang, Dongxu Wang, Ruiyuan Wang, Guanghui Yan, Guiying Qu, Cunquan |
| author_facet | Jia, Chenyuan Chang, Dongxu Wang, Ruiyuan Wang, Guanghui Yan, Guiying Qu, Cunquan |
| contents | In this study, a new scheduling strategies for low-density parity-check (LDPC) codes under layered belief propagation (LBP) is designed. Based on the criteria of prioritizing the update of check nodes with lower error probabilities, we propose two dynamic scheduling methods: dynamic error belief propagation (Dyn-EBP) and dynamic penalty error belief propagation (Dyn-PEBP). In Dyn-EBP, each check node is restricted from being updated the same number of times, whereas Dyn-PEBP removes this restriction and instead introduces a penalty term to balance the number of updates. Simulation results show that, for 5G new radio (NR) LDPC codes, our proposed scheduling methods can outperform existing dynamic and offline scheduling strategies under various blocklengths and code rates. This demonstrates that prioritizing the update of check nodes with lower error probabilities can lead to higher decoding efficiency and validates the effectiveness of our algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13507 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities Jia, Chenyuan Chang, Dongxu Wang, Ruiyuan Wang, Guanghui Yan, Guiying Qu, Cunquan Information Theory Optimization and Control Probability 94B35 (Primary) 94B70 (Secondary) E.4; F.2.2 In this study, a new scheduling strategies for low-density parity-check (LDPC) codes under layered belief propagation (LBP) is designed. Based on the criteria of prioritizing the update of check nodes with lower error probabilities, we propose two dynamic scheduling methods: dynamic error belief propagation (Dyn-EBP) and dynamic penalty error belief propagation (Dyn-PEBP). In Dyn-EBP, each check node is restricted from being updated the same number of times, whereas Dyn-PEBP removes this restriction and instead introduces a penalty term to balance the number of updates. Simulation results show that, for 5G new radio (NR) LDPC codes, our proposed scheduling methods can outperform existing dynamic and offline scheduling strategies under various blocklengths and code rates. This demonstrates that prioritizing the update of check nodes with lower error probabilities can lead to higher decoding efficiency and validates the effectiveness of our algorithms. |
| title | Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities |
| topic | Information Theory Optimization and Control Probability 94B35 (Primary) 94B70 (Secondary) E.4; F.2.2 |
| url | https://arxiv.org/abs/2506.13507 |