一种纠正插入及删节错误的极化码置信传播译码方法
By introducing a belief propagation decoding method that incorporates drift and weighted Levenstein distance, the problem of correcting insertion and pruning errors in traditional polar codes in memory channels is solved, improving error correction capability and reducing decoding delay, thus broadening the application scope of polar codes.
CN121508554BActive Publication Date: 2026-07-17TIANJIN NORMAL UNIVERSITY
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- TIANJIN NORMAL UNIVERSITY
- Filing Date
- 2025-11-14
- Publication Date
- 2026-07-17
AI Technical Summary
Technical Problem
Traditional polar codes have limited error correction capabilities when dealing with insertion and deletion errors, especially in channels with memory, where they cannot effectively correct propagation amplification caused by synchronization errors.
Method used
A belief propagation decoding method based on weighted Levenstein distance is adopted. By introducing drift and iterative update mechanisms, and combining a weighted Levenstein distance BP decoder, insertion and pruning errors are corrected, thus improving the traditional BP decoding algorithm.
Benefits of technology
It improves error correction capability, reduces decoding latency, broadens the application range of polar codes, and achieves lower frame error rate and bit error rate under harsh channel conditions.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN121508554B_ABST
Abstract
本发明公开一种纠正插入及删节错误的极化码置信传播译码方法，涉及数字通信差错控制编码领域。所述方法包括：将长度为的信息比特和长度为的全零冻结比特按预设的信息比特和固定比特的位置索引进行混合，得到比特序列；对比特序列进行编码得到长度为的发送序列；将发送序列经过IDS信道传输后得到长度为的接收序列；通过基于加权莱文斯坦距离的BP译码器对接收序列进行纠正插入及删节错误处理，输出信息序列估计值。本发明通过引入漂移量，并采用加权莱文斯坦距离作为概率度量，解决了传统BP译码算法无法纠正插入及删节错误的问题。本发明还避免了SC框架的固有问题，提高了纠错能力；并通过并行操作降低了译码时延，提升单位时间处理量。
Need to check novelty before this filing date? Find Prior Art