基于变量节点更新的交替方向乘子法 LDPC惩罚译码算法

基于交替方向乘子法(ADMM)的改进惩罚函数LDPC译码算法能够提升译码性能，但其所需优化参数过多且性能提升有限。针对该问题，将该算法与其它带有惩罚函数的译码算法比较后发现，两者的不同之处仅在于译码算法中变量节点的更新规则不同。因此，该文通过构造一种新的变量节点的更新方法去减少优化参数数目并提升译码性能。实验仿真表明，相较于原有算法，该文所提算法有效减少了所需优化的参数数目，此外，所提算法的平均迭代次数更少且能实现约0.1 dB的性能提升。

Alternating Direction Method of Multipliers LDPC Penalized Decoding Algorithm Based on Variable Node Update

The LDPC decoding algorithm with improved penalty function can improve the performance of decoding algorithm based on Alternating Direction Method of Multipliers (ADMM), but it has too many parameters to be optimized and the performance improvement is limited. For this problem, by comparing it with other decoding algorithms with penalty function, it is found that the difference between them is only the update rules of variable nodes in the decoding algorithm. Therefore, a new update method for variable nodes is proposed in this paper to reduce the number of parameters and improve the decoding performance. The simulation results show that, compared with the original decoding algorithm, the decoding algorithm in this paper reduces the parameters which need to be optimized, in addition, the average number of iterations of the algorithm is less and the algorithm can achieve about 0.1 dB performance improvement.