TY - JOUR ID - TI - Performance Analysis of Different Flexible Decoding Algorithms for NR-LDPC Codes تحليل اداء خوارزميات فك التشفير المرنة المختلفة الرموز NR-LDPC AU - Layla M. Salih AU - Thuraya Mahmoud Al-Qaradaghi AU - Jalal J. Hamad Ameen PY - 2022 VL - 29 IS - 4 SP - 10 EP - 18 JO - Tikrit Journal of Engineering Sciences مجلة تكريت للعلوم الهندسية SN - 1813162X 23127589 AB - Channel coding technique is a fundamental buildingblock in any modern communication system to realizereliable, fast, and secure data transmission. At thesame time, it is a challenging and crucial task, as thedata transmission happens in a channel where noise,fading, and other impairments are present. The LowDensityParity-Check (LDPC) codes give substantialresults close to the Shannon limit when the complexityand processing delay time are unlimited. In this paper,the performance of the LDPC decoding with fouralgorithms was investigated. The investigated fouralgorithms were Belief Propagation (BP), LayeredBelief Propagation (LBP), Normalized min-sum(NMS), and Offset min-sum (OMS). These algorithmswere examined for code rates ranging from 1/3 to 9/10and message block lengths (64, 512, 1024, and 5120)bits. The simulation results revealed the flexibility ofthese decoders in supporting these code rates andblock lengths, which enables their usage in a widerange of applications and scenarios for fifthgeneration(5G)wirelesscommunication.Inaddition,theeffect of the maximum number of decodingiterations on the error correction performance wasinvestigated, and a gain of 5.6 dB can be obtained byusing 32 decoding iterations at BER=2*10-3 instead ofone decoding iteration. The results showed that thedecoders performed better for longer message blocksthan for short message blocks, and less power wasrequired for transmitting longer messages. Finally, thecomparison results of their performance in terms ofbit error rate (BER) under the same conditionsshowed a gain of 0.8 dB using LBP at BER= 10-5compared with the NMS decoding algorithm.

ER -