跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19269 · v1

Entropy-Based and Quadratic Conditional Innovation Metrics for Informed Dynamic Scheduling of Belief-Propagation Decoding for LDPC Codes

首次提交 2026-11-14 16:58
版本更新 2026-11-14 16:58
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

We propose two enhanced conditional innovation (CI) metrics for informed dynamic scheduling (IDS) in belief-propagation (BP) decoding of LDPC codes. The CI-based residual BP (CIRBP) algorithm uses the CI metric to guide the selection of the variable node (VN) to be updated and has been shown to outperform several existing IDS-based BP decoders, especially at the early decoding stage. However, the original CI metric uses only the absolute difference between the current and precomputed posterior probabilities and does not separately account for the reliability associated with each probability. By reformulating the CI metric relative to the decision boundary, we separate each posterior probability into its decision side and a linear-distance term reflecting reliability. Replacing the latter with the binary entropy complement yields the proposed entropy-based CI (E-CI) metric. Moreover, the proposed quadratic CI (Q-CI) metric is derived from the leading quadratic term in the local expansion of the entropy complement, avoiding the logarithmic operations required for direct E-CI evaluation. We apply both proposed metrics to the CIRBP decoder and its node-wise variant. Numerical results show that the proposed metrics generally provide lower frame error rates than the original CI metric, with their relative advantages depending on the code and decoding procedure.

作者备注:25 pages, 18 figures, 3 tables

期刊信息:Entropy 2026, 28, 1246

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-14 16:58 · 最新观测版本

Entropy-Based and Quadratic Conditional Innovation Metrics for Informed Dynamic Scheduling of Belief-Propagation Decoding for LDPC Codes

We propose two enhanced conditional innovation (CI) metrics for informed dynamic scheduling (IDS) in belief-propagation (BP) decoding of LDPC codes. The CI-based residual BP (CIRBP) algorithm uses the CI metric to guide the selection of the variable node (VN) to be updated and has been shown to outperform several existing IDS-based BP decoders, especially at the early decoding stage. However, the original CI metric uses only the absolute difference between the current and precomputed posterior probabilities and does not separately account for the reliability associated with each probability. By reformulating the CI metric relative to the decision boundary, we separate each posterior probability into its decision side and a linear-distance term reflecting reliability. Replacing the latter with the binary entropy complement yields the proposed entropy-based CI (E-CI) metric. Moreover, the proposed quadratic CI (Q-CI) metric is derived from the leading quadratic term in the local expansion of the entropy complement, avoiding the logarithmic operations required for direct E-CI evaluation. We apply both proposed metrics to the CIRBP decoder and its node-wise variant. Numerical results show that the proposed metrics generally provide lower frame error rates than the original CI metric, with their relative advantages depending on the code and decoding procedure.

查看此版本解读 →查看此版本原文 ↗