In this letter we propose a novel framework for designing decoders, for Low-Density Parity Check (LDPC) codes, that surpasses the frame error rate performance of Belief-Propagation (BP) decoding on binary symmetric channels. Its key component is the adaptation method, based on the genetic optimization algorithm, that is incorporated into the recently proposed Gradient Descent Bit-Flipping Decoding with Momentum (GDBF-w/M). We show that the resulting decoder outperforms all state-of-the-art probabilistic bit-flipping decoders and, additionally, it can be trained to perform beyond BP decoding, which is verified by numerical examples that include codes used in IEEE 802.3an and 5GNR standards. The proposed framework provides a systematic method for decoder optimization without requiring knowledge of trapping sets. Moreover, it is applicable to both regular and irregular LDPC codes.

A hybrid satellite–terrestrial relay network is a simple and flexible solution that can be used to improve the performance of land mobile satellite systems, where the communication links between satellite and mobile terrestrial users can be unstable due to the multipath effect, obstacles, as well as the additional atmospheric losses. Motivated by these facts, in this paper, we analyze a system where the satellite–terrestrial links undergo shadowed Rice fading, and, following this, terrestrial relay applies the selection relaying protocol and forwards the information to the final destination using the communication link subjected to Nakagami-m fading. For the considered relaying protocol, we derive the exact closed-form expressions for the outage probability, outage capacity, and ergodic capacity, presented in polynomial–exponential form for the integer-valued fading parameters. The presented numerical results illustrate the usefulness of the selection relaying for various propagation scenarios and system geometry parameters. The obtained analytical results are corroborated by an independent simulation method, based on the originally developed fading simulator.

The use of satellites to cover remote areas is a promising approach for increasing communication availability and reliability. The satellite resources, however, can be quite costly, and developing ways to optimize their usage is of great interest. Optimizing spectral efficiency while keeping the transmission error rate above a certain threshold represents one of the crucial aspects of resource optimization. This paper provides a novel strategy for adaptive coding and modulation (ACM) employment in land mobile satellite networks. The proposed solution incorporates machine learning techniques to predict channel state information and subsequently increase the overall spectral efficiency of the network. The Digital Video Broadcasting Satellite Second Generation (DVB-S2X) satellite protocol is considered as the use case, and by using the developed channel simulator, this paper performs an evaluation of the proposed machine learning solutions for channels with various characteristics, with a total of 90 different observed channels. The results show that a convolutional neural network with a modified loss function consistently achieves an improvement (over 100% in some scenarios) of spectral efficiency compared to the state-of-the-art ACM implementation while keeping the transmission error rate under 0.01 for single channel evaluation. When observing two channels, an improvement of more than 300% compared to the outdated information spectral efficiency was obtained in multiple scenarios, showing the effectiveness of the proposed approach and allowing optimization of the handover strategy in satellite networks that allow user-centric handover executions.

In this paper we analyze the effect of hardware unreliability to performance of bit-flipping decoders of low-density parity-check (LDPC) codes. We apply expander arguments to show that the simple parallel bit flipping decoder, built partially from faulty gates, can correct a linear fraction of worst case channel errors, when gate failures are correlated and dependent on the switching activity of logic gates. In addition, we provide a lower bound on the guaranteed error correction of LDPC codes with left degree of at least eight.

We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name SuspicionDistillation reflects the main feature of the algorithm—that in every iteration, we assign a level of suspicion to each variable node about its current bit value. The level of suspicion of a variable node is used to decide whether the corresponding bit will be flipped. In addition, in each iteration, we determine the number of satisfied and unsatisfied checks that connect a suspicious node with other suspicious variable nodes. In this way, in the course of iteration, we “distill” such suspicious bits and flip them. The deterministic nature of the proposed algorithm results in a low-complexity implementation, as the bit-flipping rule can be obtained by modifying the original GDBF rule by using basic logic gates, and the modification is not applied in all decoding iterations. Furthermore, we present a more general framework based on deterministic re-initialization of the decoder input. The performance of the resulting algorithm is analyzed for the codes with various code lengths, and significant performance improvements are observed compared to the state-of-the-art hard-decision-decoding algorithms.