arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

极化码的推测连续消除译码的改进接受准则

Improved Acceptance Criteria for Speculative Successive Cancellation Decoding of Polar Codes

Marvin Rübenacke, Ryan Seah, Warren J. Gross

arXiv 2608.09660首次发表:更新:

AI 中文总结

针对极化码Spec-SC译码,提出基于汉明与椭球距离的新接受准则,结合码成员测试加速高低速率节点,性能优于FSSC及原Spec-SC译码,延迟更低且误码率相当。

AI 中文摘要

极化码的下一代数据信道应用需要高吞吐量、低延迟的译码算法。最近提出的推测连续消除(Spec-SC)译码通过并行执行连续消除(SC)译码的右分支与左分支,并在计算完g函数后验证结果,降低了平均译码延迟。本文提出基于汉明距离和椭球距离的新接受准则,提高了接受率,使低速率节点能获得更大的加速。我们还表明,将码成员测试与推测译码相结合,也能加速高速率节点。数值结果证实,两种方法在延迟方面均大幅优于快速简化SC(FSSC)译码和采用原始接受条件的Spec-SC译码,且误码率性能几乎相同。

英文摘要

Next-generation data-channel applications of polar codes demand decoding algorithms with high throughput and low latency. The recently proposed speculative successive cancellation (Spec-SC) decoding reduces average decoding latency by speculatively executing the right branch of successive cancellation (SC) decoding in parallel with the left branch, verifying the result once the g-function is computed. In this paper, we propose new acceptance criteria based on Hamming distance and ellipsoidal distance that improve acceptance rates, enabling greater speed-ups for lower-rate nodes. We further show that combining code membership testing with speculative decoding accelerates high-rate nodes as well. Numerical results confirm that both approaches outperform fast simplified SC (FSSC) decoding and Spec-SC with the original acceptance condition in terms latency by a wide margin, with virtually identical error-rate performance.

Comments7 Pages, 6 Figures

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑