Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Communications Letters

Accelerating Pro-ADMM-HL Penalized Algorithm for Decoding Binary LDPC Codes

Jing Bai, Weipeng Duan, Yuhao Chi, Chau Yuen

Published May 8, 2024• 3 citations
Publisher

Abstract

The alternating direction method of multipliers (ADMM) approach to decoding low-density parity-check (LDPC) codes has garnered lots of attention due to its superior error correction performance in error floor regions. However, improving convergence characteristic of ADMM decoding efficiently remains to be a crucial but challenging issue for practical application. In order to tackle this challenge, in this paper we first propose an efficient Pro-ADMM-based decoding algorithm framework by inserting additional quadratic proximal terms to each iteration of ADMM decoding for stabilizing the variable updates. Second, an message-passing interpretation of Pro-ADMM decoder is considered, and then an improved version based on horizontal layered scheduling, named Pro-ADMM-HL decoder is developed to further enhance the convergence behavior of Pro-ADMM decoding. Additionally, we analyze that the complexity of the proposed Pro-ADMM-HL decoders at each iteration displays linearly to LDPC code length. Finally, the effectiveness of the proposed Pro-ADMM and Pro-ADMM-HL decoding algorithm in terms of error correction performance and convergence characteristic is demonstrated by simulation results.

DOI
10.1109/lcomm.2024.3398596

Related papers

Efficient ADMM Decoder for Binary LDPC Codes in Low-Iteration Regime

Yuxin Cheng, Yujie Ma, Qinglin Zhang +1 more

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.

IEEE Communications Letters•Jul 2, 2025•2 citations

Improved Free-of-CPP ADMM-Based Iterative Decoding Algorithm of Binary LDPC Codes

Jing Bai, Zedong An, Yuhao Chi +2 more

Iterative decoding algorithms based on the alternating direction method of multipliers (ADMM) decoding of low density parity check (LDPC) codes has emerged as an alternating decoding method and bringed a boom of research on drawing upon mathematical optimization to LDPC decoding. Improving error-correcting performance is a key issue to enhance the superiority of ADMM decoding. In this letter, we investigate an efficient ADMM-based iterative decoder for binary LDPC codes. First, we build an mathematical programming equivalence of the maximum likelihood (ML) decoding problem by transforming parity-check constraints to multiple equivalent linear constraints and eliminating check-polytope projection (CPP). Then, an iterative algorithm based on ADMM technique is developed to solve this free-of-CPP (FCPP) equivalence and each ADMM update can be computed efficiently. Moreover, the proposed ADMM-FCPP decoding algorithm is analyzed to display a linear complexity to the length of the LDPC code at each iteration. Finally, simulation results demonstrate the superiority of the proposed decoder in error-correcting performance compared with the state-of-the-art ADMM-based decoders.

IEEE Signal Processing Letters•Dec 4, 2024•3 citations

Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes

Biao Wang

For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 7, 2020•2 citations

Low-Density Parity-Check Decoding Algorithm Based on Symmetric Alternating Direction Method of Multipliers

Ji Zhang, Anmin Chen, Ying Zhang +3 more

The Alternating Direction Method of Multipliers (ADMM) has proven to be an efficient approach for implementing linear programming (LP) decoding of low-density parity-check (LDPC) codes. By introducing penalty terms into the LP decoding model's objective function, ADMM-based variable node penalized decoding effectively mitigates non-integral solutions, thereby improving frame error rate (FER) performance, especially in the low signal-to-noise ratio (SNR) region. In this paper, we leverage the ADMM framework to derive explicit iterative steps for solving the LP decoding problem for LDPC codes with penalty functions. To further enhance decoding efficiency and accuracy, We propose an LDPC code decoding algorithm based on the symmetric ADMM (S-ADMM). We also establish some contraction properties satisfied by the iterative sequence of the algorithm. Through simulation experiments, we evaluate the proposed S-ADMM decoder using three standard LDPC codes and three representative fifth-generation (5G) codes. The results show that the S-ADMM decoder consistently outperforms conventional ADMM penalized decoders, offering significant improvements in decoding performance.

Entropy•Apr 9, 2025•1 citation

An Efficient ADMM-Based Penalized Decoding Algorithm for Binary LDPC Code

Weipeng Duan, Jing Bai, Zedong An +1 more

LDPC decoding algorithm based on the alternating direction method of multipliers (ADMM) technique has increased much attentions because of its outstanding decoding performance. To enhancing performance advantages of ADMM decoding in practical application, a main challenge is to design an efficient penalty function and then customize an accelerating decoding algorithm. To address this issue, in this paper we propose an improved penalized decoding problem based on a segmented penalty function (SPF), and then develop an efficient ADMM algorithm via optimizing variable updating to solve this SPF-based decoding model. Experimental simulations demonstrate that the proposed algorithm effectively reduces the number of iterations while achieving better error-correction performance, when compared to the state-of-the-art ADMM-based decoding algorithms.

International Conference on Communications, Information System and Computer Engineering (CISCE)•May 10, 2024•0 citations

ADMM Decoding of LDPC Codes: Simplification and Improvement

Haoyuan Wei

In this dissertation, we study linear programming (LP) decoding of low-density parity-check (LDPC) codes based on the alternating direction method of multipliers (ADMM) technique, or ADMM decoding for short.The decoding of LDPC codes is formulated as an LP model and solved efficiently by the ADMM technique.However, compared with traditional belief-propagation decoding, ADMM decoding suffers from higher complexity and worse error correction performance, which prevents the employment of ADMM decoding in reality.To reduce the complexity of ADMM decoding, we first focus on the simplification of the check polytope projection, the most complex operation in ADMM decoding.We propose an iterative check polytope projection algorithm without the sorting operation.The proposed algorithm converges with the increase of iterations.Moreover, for a fixed number of iterations, its average complexity and the worst-case complexity are linear in the input dimension.Another direction we propose to simplify ADMM decoding is to devise a better scheduling scheme than the standard flooding scheme.We start from the node-wise scheduling scheme which only updates the check node messages with the maximum message residual.Then we simplify the calculation of the message residual and propose a reduced-complexity node-wise scheduling scheme.To improve the error correction performance of ADMM decoding, we propose a novel ADMM penalized decoding algorithm whose penalty term is based on check nodes (CN).We investigate the properties of the CN penalty functions and show several examples.We make conclusions on its convergence properties and prove its failure probability is independent of the transmitted codewords for symmetric channels.Monte-Carlo simulation and the instanton analysis show its better error correction performance in the low and high SNR regions.Finally, we propose a post-processing technique to lower the error floor of LDPC codes.The output of the first stage decoder can be revised if the syndrome is found This is a journey with joys and tears.I encountered many amazing people.They instructed me, helped me, and accompanied me.First of all, I would like to thank Prof. Amir H. Banihashemi for his guidance.His attitudes towards the research and devotion to one specific area are impressive.All these will have a life-long influence on me.It is also a great time working with people in his coding research group.I have a great memory of learning from their presentations.Next, I should thank Prof.

•Jan 1, 2021•0 citations
The alternating direction method of multipliers (ADMM) approach to decoding low-density parity-check (LDPC) codes has garnered lots of attention due to its superior error correction performance in error floor regions. However, improving convergence characteristic of ADMM decoding efficiently remains to be a crucial but challenging issue for practical application. In order to tackle this challenge, in this paper we first propose an efficient Pro-ADMM-based decoding algorithm framework by inserting additional quadratic proximal terms to each iteration of ADMM decoding for stabilizing the variable updates. Second, an message-passing interpretation of Pro-ADMM decoder is considered, and then an improved version based on horizontal layered scheduling, named Pro-ADMM-HL decoder is developed to further enhance the convergence behavior of Pro-ADMM decoding. Additionally, we analyze that the complexity of the proposed Pro-ADMM-HL decoders at each iteration displays linearly to LDPC code length. Finally, the effectiveness of the proposed Pro-ADMM and Pro-ADMM-HL decoding algorithm in terms of error correction performance and convergence characteristic is demonstrated by simulation results.
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.
Iterative decoding algorithms based on the alternating direction method of multipliers (ADMM) decoding of low density parity check (LDPC) codes has emerged as an alternating decoding method and bringed a boom of research on drawing upon mathematical optimization to LDPC decoding. Improving error-correcting performance is a key issue to enhance the superiority of ADMM decoding. In this letter, we investigate an efficient ADMM-based iterative decoder for binary LDPC codes. First, we build an mathematical programming equivalence of the maximum likelihood (ML) decoding problem by transforming parity-check constraints to multiple equivalent linear constraints and eliminating check-polytope projection (CPP). Then, an iterative algorithm based on ADMM technique is developed to solve this free-of-CPP (FCPP) equivalence and each ADMM update can be computed efficiently. Moreover, the proposed ADMM-FCPP decoding algorithm is analyzed to display a linear complexity to the length of the LDPC code at each iteration. Finally, simulation results demonstrate the superiority of the proposed decoder in error-correcting performance compared with the state-of-the-art ADMM-based decoders.
For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.
The Alternating Direction Method of Multipliers (ADMM) has proven to be an efficient approach for implementing linear programming (LP) decoding of low-density parity-check (LDPC) codes. By introducing penalty terms into the LP decoding model's objective function, ADMM-based variable node penalized decoding effectively mitigates non-integral solutions, thereby improving frame error rate (FER) performance, especially in the low signal-to-noise ratio (SNR) region. In this paper, we leverage the ADMM framework to derive explicit iterative steps for solving the LP decoding problem for LDPC codes with penalty functions. To further enhance decoding efficiency and accuracy, We propose an LDPC code decoding algorithm based on the symmetric ADMM (S-ADMM). We also establish some contraction properties satisfied by the iterative sequence of the algorithm. Through simulation experiments, we evaluate the proposed S-ADMM decoder using three standard LDPC codes and three representative fifth-generation (5G) codes. The results show that the S-ADMM decoder consistently outperforms conventional ADMM penalized decoders, offering significant improvements in decoding performance.
LDPC decoding algorithm based on the alternating direction method of multipliers (ADMM) technique has increased much attentions because of its outstanding decoding performance. To enhancing performance advantages of ADMM decoding in practical application, a main challenge is to design an efficient penalty function and then customize an accelerating decoding algorithm. To address this issue, in this paper we propose an improved penalized decoding problem based on a segmented penalty function (SPF), and then develop an efficient ADMM algorithm via optimizing variable updating to solve this SPF-based decoding model. Experimental simulations demonstrate that the proposed algorithm effectively reduces the number of iterations while achieving better error-correction performance, when compared to the state-of-the-art ADMM-based decoding algorithms.
In this dissertation, we study linear programming (LP) decoding of low-density parity-check (LDPC) codes based on the alternating direction method of multipliers (ADMM) technique, or ADMM decoding for short.The decoding of LDPC codes is formulated as an LP model and solved efficiently by the ADMM technique.However, compared with traditional belief-propagation decoding, ADMM decoding suffers from higher complexity and worse error correction performance, which prevents the employment of ADMM decoding in reality.To reduce the complexity of ADMM decoding, we first focus on the simplification of the check polytope projection, the most complex operation in ADMM decoding.We propose an iterative check polytope projection algorithm without the sorting operation.The proposed algorithm converges with the increase of iterations.Moreover, for a fixed number of iterations, its average complexity and the worst-case complexity are linear in the input dimension.Another direction we propose to simplify ADMM decoding is to devise a better scheduling scheme than the standard flooding scheme.We start from the node-wise scheduling scheme which only updates the check node messages with the maximum message residual.Then we simplify the calculation of the message residual and propose a reduced-complexity node-wise scheduling scheme.To improve the error correction performance of ADMM decoding, we propose a novel ADMM penalized decoding algorithm whose penalty term is based on check nodes (CN).We investigate the properties of the CN penalty functions and show several examples.We make conclusions on its convergence properties and prove its failure probability is independent of the transmitted codewords for symmetric channels.Monte-Carlo simulation and the instanton analysis show its better error correction performance in the low and high SNR regions.Finally, we propose a post-processing technique to lower the error floor of LDPC codes.The output of the first stage decoder can be revised if the syndrome is found This is a journey with joys and tears.I encountered many amazing people.They instructed me, helped me, and accompanied me.First of all, I would like to thank Prof. Amir H. Banihashemi for his guidance.His attitudes towards the research and devotion to one specific area are impressive.All these will have a life-long influence on me.It is also a great time working with people in his coding research group.I have a great memory of learning from their presentations.Next, I should thank Prof.