.png){kind=icon}
返回
Adaptive Group Shuffled Symbol Flipping Decoding Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3387278.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper introduces two decoding techniques based on grouping for symbol flipping non-binary LDPC codes. Firstly, a new technique of adaptive grouping of variable nodes in each iteration using bit reliability and majority voting of each received symbol is presented. Grouping of variable nodes and the subsequent decoding are based on individual symbol reliability and majority voting. To form groups adaptively, the cumulative density of variable nodes is used where a high priority group is considered to contain the most unreliable variable nodes and is decoded while the second priority group contains variable nodes having a second level of reliability and so on. Secondly, a fixed grouping technique is applied to symbol flipping decoding of non-binary LDPC codes. In the fixed grouping decoding, each group contains an equal number of variable nodes, and selected symbols in each group are flipped according to pre-defined flipping criteria. Numerical results and analysis show that the proposed group-based hard decision symbol flipping decoding algorithms have the advantage of reduced computational complexity and show better performance. Therefore, the proposed algorithms can be considered for applications like data storage and mobile communication.
Keyword:
Adaptive group shuffled decoding
non binary LDPC
symbol flipping decoding
sum product algorithms
layered decoding
channel coding
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Three iodocuprate hybrids symmetrically modulated by positional isomers and the chiral conformation of N-benzyl-methylpyridinium.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容