| 基于节点选择更新的简化LDPC译码算法 |
| |
| 引用本文： | 何欢,刘朋利,徐友云,蔡跃明.基于节点选择更新的简化LDPC译码算法[J].军事通信技术,2008(4). |
| |
| 作者姓名： | 何欢 刘朋利 徐友云 蔡跃明 |
| |
| 作者单位： | 解放军理工大学通信工程学院研究生1队;解放军理工大学通信工程学院研究生3队;解放军理工大学通信工程学院无线通信系; |
| |
| 基金项目： | 江苏省自然科学基金资助项目(BK2006701,BK2007002) |
| |
| 摘 要： | 文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。
|
| 关 键 词： | 低密度奇偶校验码 多元低密度奇偶校验码 置信传播译码算法 节点选择更新 二分图 环 |
Simplified Decoding Algorithm of LDPC Codes Based on Selective Node Updating Scheme |
| |
| HE Huan,LIU Peng-li,XU You-yun,CAI Yue-ming.Simplified Decoding Algorithm of LDPC Codes Based on Selective Node Updating Scheme[J].Journal of Military Communications Technology,2008(4). |
| |
| Authors: | HE Huan LIU Peng-li XU You-yun CAI Yue-ming |
| |
| Institution: | HE Huan1,LIU Peng-li2,XU You-yun3,CAI Yue-ming3(1.Postgraduate Team 1 ICE,PLAUST,Nanjing 210007,China,2.Postgraduate Team 3 ICE,3.Department of Radio Communication ICE,PLAUST) |
| |
| Abstract: | By analyzing the feature of information passing through short cycles in Tanner graph,a simplified BP decoding algorithm based on selective node updating was introduced.The decoding complexity can be reduced by avoiding the influence of short cycles on decoding performance to certain extent.Simulation results show that decoding of binary LDPC codes and non-binary LDPC codes by this algorithm causes only a little loss of error-correcting capacity compared with BP algorithm. |
| |
| Keywords: | LDPC codes non-binary LDPC codes Belief Propagation algorithm(BP algorithm) selective node updating scheme Tanner graph cycles |
| 本文献已被 CNKI 等数据库收录！ |
