Comparative Analysis of the Error-Correction Performance of LDPC Decoding Algorithms

Zhuldyz Sailau kyzy, Murat G. Kozhanov, Г. Т. Даненова, М. Жакина, Azamat Amirov

2026

Closed access Metadata (CSL-JSON)
DOI 10.52209/3107-1503_2026_1_2
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The article presents a comparative study of LDPC decoding algorithms in an additive white Gaussian noise (AWGN) channel. The aim is to identify the most efficient algorithms for reliable data transmission. Simulations were carried out using the AFF3CT tool with BPSK modulation. Several decoders were analyzed, including GALA, GALB, GALE, PPBF, WBF and MWBF. Performance was evaluated by bit error rate (BER) and frame error rate (FER). The results show that the GalE decoder achieves the best error-correction performance for long codewords (length 20480), with BER values reaching 10-5 and 10-10. For shorter code lengths, MWBF and GalE algorithms also demonstrate good results, with MWBF reaching BER ≈ 10-3 at SNR = 7 dB. In resource-limited conditions, simplified bit-flipping algorithms can provide reasonable efficiency