通过并行概率比特动力学中的位对齐时间强化降低LDPC解码错误率
Error-Rate Reduction in LDPC Decoding via Bit-Aligned Temporal Reinforcement in Parallel Probabilistic-Bit Dynamics
- Research Institute of Electrical Communication, Tohoku University（东北大学电气通信研究所）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本研究提出一种位对齐时间强化方法，通过存储并重用饱和响应来改进LDPC解码，相比传统pSA方法在多种码长下显著降低比特错误率，并揭示了时间状态计算效果的机制。
AI中文摘要：
概率比特（p-bit）为随机推断提供了物理和算法上的原语，但高度并行的更新可能改变其集体动力学。我们研究了使用Jacobi型p-bit退火和随机部分激活对随机正则(3,6)低密度奇偶校验（LDPC）码进行解码。一种加性响应路径规则存储每个比特的饱和响应，并在随机读出前重用它。针对每种方法独立优化参数的高统计量模拟显示，与无记忆概率模拟退火（pSA）相比，对于块长度分别为96、192和288的代表性码，合并的比特错误率分别降低了33.5%、74.8%和81.8%。在相同的非记忆参数下，仅调整其系数的静态增益、归一化平均、响应洗牌和同比特二进制状态反馈均无法重现完整的饱和响应收益。轨迹分析将改进归因于获取与信道一致的合法码字盆地以及增强的获取后稳定性；在测试条件下，从随机和信道硬判决起始，获取优势持续存在。在所有30个独立码实现中，固定的加性参数和读出包实现了比单独优化的pSA特定包更低的比特和帧错误率，且两个包均未针对单个码重新调整。这些结果表明，时间状态的计算效果取决于保留的量及其在随机动力学中的再注入。
英文摘要：
Probabilistic bits (p-bits) provide a physical and algorithmic primitive for stochastic inference, but highly parallel updates can alter their collective dynamics. We study the decoding of random-regular (3, 6) low-density parity-check (LDPC) codes using Jacobi-type p-bit annealing with stochastic partial activation. An additive response-path rule stores each bit's saturated response and reuses it before stochastic readout. High-statistics simulations with independent parameter optimization for each method show pooled bit-error-rate reductions of 33.5%, 74.8%, and 81.8% relative to memoryless probabilistic simulated annealing (pSA) for representative codes of block lengths 96, 192, and 288, respectively. Static gain, normalized averaging, response shuffling, and same-bit binary-state feedback with only its coefficient tuned under the same nonmemory parameters do not reproduce the full saturated-response benefit. Trajectory analysis links the improvement to acquisition of the channel-consistent valid-codeword basin and enhanced post-acquisition stability; the acquisition advantage persists from random and channel-hard-decision starts under the tested conditions. Across all 30 independent code realizations, fixed additive parameter-and-readout packages achieve lower bit- and frame-error rates than separately optimized pSA-specific packages, with neither package retuned for individual codes. These results show that the computational effect of temporal state depends on the retained quantity and its reinjection into stochastic dynamics.
