| 摘要: |
| LDPC码置信传播算法由于复杂度过高而无法实际应用，最小和算法虽然能降低复杂度但却带来了较大的性能损失。补偿最小和算法通过在最小和算法中引入固定修正因子，在几乎不增加算法复杂度的条件下获得接近置信传播算法的性能。为了进一步提升补偿最小和算法的性能，给出了补偿最小和算法的自适应修正因子的计算方法并结合层译码调度策略，提出层自适应补偿最小和算法。仿真表明，所提算法具有更优的性能和更快的收敛速度。 |
| 关键词: LDPC码 补偿最小和算法 自适应修正因子 |
| DOI： |
|
| 基金项目:国家科技重大专项（2018ZX03001026-002） |
|
| Adaptive offset minimum sum decoding algorithm for LDPC codes |
| WANG Qiong,LI Sifang,LUO Yajie |
| (a.School of Communication and Information Engineering;b.Innovation Team of Communication Core Chip,Protocols and System Application,Chongqing University of Posts and Telecommunications,Chongqing 400065,China) |
| Abstract: |
| In order to solve the problem that the belief propagation algorithm of low-density parity-check(LDPC) code can not be practically applied due to its high complexity,the minimum sum algorithm is proposed.Although the complexity is reduced,it brings greater performance loss.The offset minimum sum algorithm achieves near belief propagation algorithm performance with almost no increase in algorithm complexity by introducing a fixed correction factor into the minimum sum algorithm.For further improving the performance of the offset minimum sum algorithm,a calculation method of the adaptive correction factor is given,and by combining with the layer decoding schedules,the layer adaptive offset minimum sum algorithm is proposed.Simulation shows that the proposed algorithm has better performance and faster convergence speed. |
| Key words: LDPC code offset minimum sum algorithm adaptive correction factor |
《电讯技术》编辑部 