Efficient ADMM Decoder for Binary LDPC Codes in Low-iteration regime

The alternating direction method of multipliers (ADMM) algorithm for decoding low-density parity-check (LDPC) codes has attracted significant attention because of its superior performance. The convergence characteristic has been regarded as a crucial element to enhance its advantage in practice. In this paper, an efficient ADMM decoder for binary LDPC codes is proposed by adjusting the position of the Euclidean projection to enhance the convergence behavior. The simulation results show that the proposed algorithm can improve the FER performance by 1.1dB as well as save average decoding iterations by 13% compared with the existing CSA when the maximum number of iterations is set to 20. The proposed algorithm can be suitable for use at low-iteration regime in high-throughput scenarios.