Derived dynamic scheduling for belief propagation decoding of LDPC codes
Abstract Among numerous dynamic scheduling strategies for low‐density parity‐check codes, many of them are of high complexity due to repetitive computation and ordering of belief residuals. To address these challenges, two novel approaches are proposed: the derived informed variable‐to‐check residua...
| Auteurs principaux: | , , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Wiley
2024-02-01
|
| Collection: | Electronics Letters |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.1049/ell2.13130 |