Information and communication and chemical technologies

Vol. 3 No. 28 (2025) / 2025-09-30 / Number of views: 217

THE PERFORMANCE ANALYSIS OF LDPC-DECODERS TO ENSURE THE RELIABLE DATA TRANSMISSION IN A NOISY ENVIRONMENT

Authors

A.Saginov Karaganda Technical University
https://orcid.org/0009-0006-8551-5063
A.Saginov Karaganda Technical University
https://orcid.org/0000-0001-7605-7634
A.Saginov Karaganda Technical University
https://orcid.org/0000-0003-4353-1728
LLP “Adal Damu”
https://orcid.org/0000-0002-7319-3785
A.Saginov Karaganda Technical University
https://orcid.org/0009-0007-9447-0108

Keywords

low-density parity check code, decoding algorithms, bit error rate, frame error rate, communication system, noise-resistant coding

Link to DOI:

https://doi.org/10.58805/kazutb.v.3.28-976

How to quote

Zhakina, M., et al. “THE PERFORMANCE ANALYSIS OF LDPC-DECODERS TO ENSURE THE RELIABLE DATA TRANSMISSION IN A NOISY ENVIRONMENT”. Vestnik KazUTB, vol. 3, no. 28, Sept. 2025, doi:10.58805/kazutb.v.3.28-976.

Abstract

The article presents a comparative analysis of the performance of various LDPC decoding algorithms in a channel with additive white Gaussian noise (AWGN). The objective of the study is to identify the most efficient LDPC decoding methods that provide reliable data transmission under AWGN conditions. The AFF3CT tool was used for the simulation, which provides ample opportunities for fine-tuning the experimental parameters and detailed analysis of the decoder operation. The process of data transmission over a communication channel includes the following key stages: generation of initial data, encoding using LDPC codes, modulation (BPSK is used in this paper), adding AWGN noise, demodulation, and subsequent decoding. The following LDPC decoding algorithms were considered in the study: GALA, GALB, GALE, PPBF, WBF, and MWBF. The bit error rate (BER) and frame error rate (FER) were used as performance evaluation metrics. The results of numerical simulation demonstrated that the BP_FLOODING and BIT_FLIPPING algorithms implemented in different decoders exhibit different efficiency depending on the noise level and simulation parameters. Analysis of the obtained data allows us to conclude that the GALE algorithm demonstrates the highest efficiency when decoding messages of 20480 bits in length. Under conditions of limited computing resources, algorithms with a small number of iterations, in particular based on BIT_FLIPPING, can also provide acceptable performance. For decoding short messages, the most appropriate choice is the MWBF or GALE decoders.