ADMM Check Node Penalized Decoders for LDPC Codes

Wei, Haoyuan; Banihashemi, Amir H.

doi:10.1109/tcomm.2021.3065976

Cited by 11 publications

(3 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the relevant parameters optimization is very difficult and extremely time-consuming. Recently, Wei et al proposed a novel ADMM check node (CN) penalized decoding algorithm that codeword solutions which satisfy all parity-check equations will have smaller penalty values than non-codeword solutions [14]. The proposed CN-penalized decoder in [14] can improve the FER performance at the expense of increase in the decoding complexity.…”

Section: Introductionmentioning

confidence: 99%

A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes

Liu

Jiang

et al. 2023

IEEE Access

View full text Add to dashboard Cite

ADMM penalized decoding method for Low-Density Parity-Check (LDPC) Codes can improve the frame error rate (FER) performance than the standard ADMM decoder by adding penalty terms to the objective function. However, penalty parameter optimization of the penalty terms is very difficult and extremely time-consuming. Additionally, the Euclidean projection onto the check polytope is the most complex part of ADMM-based decoding algorithms. In this paper, by dynamically choosing even-vertex in the check polytope closest to the input vector as the approximate projection, a simple and novel check polytope projection penalized algorithm for ADMM decoding is proposed which can avoid the tedious work of penalty parameter optimization and simplify the check polytope projection. The simulation results show that the proposed algorithm can substantially reduce the projection time while achieving better FER performance when compared with the existing penalized decoding. In particular, the proposed algorithm can save the decoding time by 23% to 41% compared with ADMM-PD-LSA algorithm.INDEX TERMS Alternating direction method of multipliers (ADMM), low-density parity-check (LDPC) codes, penalty terms, check polytope projection.

show abstract

Section: Introductionmentioning

confidence: 99%

A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes

Liu

Jiang

et al. 2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…To eliminate the undesired pseudo-codewords, a series of cut-generating algorithms [13]- [15] were proposed to improved the error correction performance of the LP decoders. Moreover, Liu et al in [16] and Bai et al in [17] constructed an ADMM-based variable node penalized decoder, Wei et al in [18] proposed an ADMM-based check node penalized decoder. These decoders all added a non-convex term to the LP decoding objective, which promoted the error correction performance of LP decoding in low SNR region and did not suffer from the error-floor like BP decoders.…”

Section: Introductionmentioning

confidence: 99%

Efficient ADMM Decoder for Non-binary LDPC Codes with Codeword-Independent Performance

Guo¹,

Wang²

2022

Preprint

View full text Add to dashboard Cite

In this paper, we devote to devise a non-binary low-density parity-check (LDPC) decoder in Galois fields of characteristic two (F2q ) via the alternating direction method of multipliers (ADMM) technique. Through the proposed bit embedding technique and the decomposition technique of the three-variables parity-check equation, an efficient ADMM decoding algorithm for non-binary LDPC codes is proposed. The computation complexity in each ADMM iteration is roughly O(nq), which is significantly lower than the existing LDPC decoders. Moreover, we prove that the proposed decoder satisfies the favorable property of the codeword-independent. Simulation results demonstrate the outstanding performance of the proposed decoder in contrast with state-of-the-art LDPC decoders.

show abstract

“…By exploiting the quadratic programming (QP) model's inside structure, Bai et al developed an efficient QP ADMM decoding algorithm that attains better performance [20]. Taking the check node (CN) as the core, Wei et al proposed a novel ADMM CN-penalized decoder that improved the ADMM variable node (VN) penalized decoder's performance [21]. In addition, Wasson et al presented a hardware-based implementation of ADMM-based LP decoding that attained excellent error-rate performance [22].…”

Section: Introductionmentioning

confidence: 99%

Horizontal Layered Scheduling ADMM Penalized Decoder Based on the Improved Penalty Function for LDPC

Wang

2022

IEEE Access

View full text Add to dashboard Cite

For low-density parity-check (LDPC) codes, reducing the number of Euclidean projections, choosing a suitable scheduling strategy, and devising an improved penalty function are three effective ways to increase the alternating direction method of multipliers (ADMM) penalized decoding speed. By combining the above three ways, this paper proposes a horizontal layered scheduling ADMM penalized decoder based on the improved penalty function to speed up decoding. The experimental data indicate that the proposed decoder can obtain better performance and lower average number of iterations than the existing ADMM penalized decoders.INDEX TERMS Horizontal layered scheduling, alternating direction method of multipliers, penalized decoding, low-density parity-check codes

show abstract

ADMM Check Node Penalized Decoders for LDPC Codes

Cited by 11 publications

References 44 publications

A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes

A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes

Efficient ADMM Decoder for Non-binary LDPC Codes with Codeword-Independent Performance

Horizontal Layered Scheduling ADMM Penalized Decoder Based on the Improved Penalty Function for LDPC

Contact Info

Product

Resources

About