Movatterモバイル変換

• Yan LIN

  College of Physical Science and Technology, Central China Normal University

• Qiaoqiao XIA

  College of Physical Science and Technology, Central China Normal University

• Wenwu HE

  School of Electronic Information, Wuhan University

• Qinglin ZHANG

  College of Physical Science and Technology, Central China Normal University

Using linear programming (LP) decoding based on alternating direction method of multipliers (ADMM) for low-density parity-check (LDPC) codes shows lower complexity than the original LP decoding. However, the development of the ADMM-LP decoding algorithm could still be limited by the computational complexity of Euclidean projections onto parity check polytope. In this paper, we proposed a bisection method iterative algorithm (BMIA) for projection onto parity check polytope avoiding sorting operation and the complexity is linear. In addition, the convergence of the proposed algorithm is more than three times as fast as the existing algorithm, which can even be 10 times in the case of high input dimension.