Adaptive Group Based Symbol Flipping Decoding Algorithm

This paper introduces an adaptive technique for grouping variable nodes in decoding non-binary LDPC codes that involve symbol flipping. The technique considers both the individual symbol reliability and majority-based voting when grouping variable nodes in each iteration. Groups are formed based on...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE Vehicular Technology Conference pp. 1 - 6
Main Authors:	Ullah, Waheed, Jayakody, Dushantha Nalin K., Yang, Fengfan, Beko, Marko
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2023
Subjects:	Adaptive Group Shuffled Decoding Bit error rate Decoding Layered Decoding Majority logic decoding Memory Non Binary LDPC Numerical analysis Reliability Sum Product Algorithms Symbol Flipping Decoding Symbols Vehicular and wireless technologies
ISSN:	2577-2465
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper introduces an adaptive technique for grouping variable nodes in decoding non-binary LDPC codes that involve symbol flipping. The technique considers both the individual symbol reliability and majority-based voting when grouping variable nodes in each iteration. Groups are formed based on the cumulative density of the variable nodes, with the least reliable variable nodes given the highest priority. The decoding algorithm then proceeds to decode subsequent groups in order of decreasing priority. The results of numerical analysis demonstrate that this approach strikes a balance between computational complexity and bit error rate performance, making it suitable for various applications, such as data storage and mobile networks.
ISSN:	2577-2465
DOI:	10.1109/VTC2023-Spring57618.2023.10200963