Min-sum algorithm-structure based decoding algorithms for LDPC codes

Vityazev, Vladimir; Likhobabin, Evgeny; Ustinova, E. A.

doi:10.1109/meco.2014.6862710

Cited by 9 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, simplified variations of this algorithm based on MPA (Message Passing Algorithm) and SPA (Sum-Product Algorithm) are used. The developed model uses SPA [3,[9][10][11].…”

Section: Channel Codecmentioning

confidence: 99%

Evaluation of LDPC codes efficiency in channels with fading

Shinkevich

Pokamestov²,

Kryukov³

et al. 2023

E3S Web of Conf.

View full text Add to dashboard Cite

The article discusses the operation of communication systems using a low-density parity check codes in channels with multipath propagation. This class of codes has found wide application in modern communication and broadcasting systems and is one of the most effective in now. Some theoretical and practical issues of combating the effects arising from multipath propagation are presented. The description of the developed simulation model, channel codec, equalizer, and transmission channel is given. The channel encoder in the model is designed in accordance with the specifications for the 5G New Radio (5G NR) communication standard. The multipath parameters in the transmission channel correspond to the TDL models for 5G NR, with the exception of the Doppler shift, which is not taken into account in the simulation. In addition, there is additive interference in the channel. The decoding algorithm used was also described in detail. As a result of the study, the dependences of the bit error probability on the signal-to-noise ratio were obtained for the code rates 1/2 and 1/8, as well as for the system without coding. Based on the results obtained, it is possible to judge the correcting ability of this class of codes.

show abstract

“…Instead, simplified variations of this algorithm based on MPA (Message Passing Algorithm) and SPA (Sum-Product Algorithm) are used. The developed model uses SPA [3,[9][10][11].…”

Section: Channel Codecmentioning

confidence: 99%

Evaluation of LDPC codes efficiency in channels with fading

Shinkevich

Pokamestov²,

Kryukov³

et al. 2023

E3S Web of Conf.

View full text Add to dashboard Cite

show abstract

“…Furthermore, BP modification known as min-sum algorithm was also developed to reduce the complexity [45]- [50]. Min-sum algorithm used simple comparison and summation operation by finding only two lowest values of reliability at check nodes [46]. Min-sum can significantly reduce the computational complexity of BP at the cost of small performance loss.…”

Section: Ldpc Decoding Approachmentioning

confidence: 99%

Decoding of Decode and Forward (DF) Relay Protocol using Min-Sum Based Low Density Parity Check (LDPC) System

Suud

Zen

Othman

et al. 2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

Decoding high complexity is a major issue to design a decode and forward (DF) relay protocol. Thus, the establishment of low complexity decoding system would beneficial to assist decode and forward relay protocol. This paper reviews existing methods for the min-sum based LDPC decoding system as the low complexity decoding system. Reference lists of chosen articles were further reviewed for associated publications. This paper introduces comprehensive system model representing and describing the methods developed for LDPC based for DF relay protocol. It is consists of a number of components: (1) encoder and modulation at the source node, (2) demodulation, decoding, encoding and modulation at relay node, and (3) demodulation and decoding at the destination node. This paper also proposes a new taxonomy for min-sum based LDPC decoding techniques, highlights some of the most important components such as data used, result performances and profiles the Variable and Check Node (VCN) operation methods that have the potential to be used in DF relay protocol. Min-sum based LDPC decoding methods have the potential to provide an objective measure the best tradeoff between low complexities decoding process and the decoding error performance, and emerge as a cost-effective solution for practical application.

show abstract

“…LDPC decoding is performed through an iterative decoding algorithm based on the Tanner graph. LDPC decoding algorithms are termed as message-passing iterative decoding algorithms which perform local calculations at check (variable) nodes and pass those local results via messages to variable (check) nodes [29,30,[55][56][57][58][59][60][61][62][63]. Based on the information exchanged between the check node and variable nodes, LDPC decoding can be classified into two types:…”

Section: Ldpc Decodingmentioning

confidence: 99%