Adaptive Normalized Min-Sum Decoding Algorithm For LDPC Codes in Flash Memory

For globally coupled low density parity check (GCLDPC) codes, the normalized Min-Sum (NMS) algorithm is a widely-used decoding algorithm but suffers from the degraded performance and the slow convergence speed. To address this issue, in this paper, by analyzing the relation between the bit error ratio (BER) and the degree of polarization of log-likelihood ratio (LLR) information, we propose an adaptive NMS decoding algorithm. In particular, the normalized factor is dynamically adjusted based on the average LLR information in the initial and the current iterations. Besides, the two-level decoding scheme is considered. Simulation results show that, in the additive white Gaussian noise (AWGN) channels and the flash memory channels, as compared with the NMS algorithm, our algorithm significantly improves the decoding performance and the convergence speed.

Authors

Institutions

Publication Details

Published
2025-08-10
DOI
https://doi.org/10.1109/iccc65529.2025.11149292
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Normalized Min-Sum Decoding Algorithm For LDPC Codes in Flash Memory

Sha Tao, Yi Fang, Xiongfei Zhai, Guojun Han et al.
Error Correcting Code Techniques
article

Adaptive Normalized Min-Sum Decoding Algorithm For LDPC Codes in Flash Memory

Sha Tao, Yi Fang, Xiongfei Zhai, Guojun Han, Min Yu, M. Hu
article en

Abstract

For globally coupled low density parity check (GCLDPC) codes, the normalized Min-Sum (NMS) algorithm is a widely-used decoding algorithm but suffers from the degraded performance and the slow convergence speed. To address this issue, in this paper, by analyzing the relation between the bit error ratio (BER) and the degree of polarization of log-likelihood ratio (LLR) information, we propose an adaptive NMS decoding algorithm. In particular, the normalized factor is dynamically adjusted based on the average LLR information in the initial and the current iterations. Besides, the two-level decoding scheme is considered. Simulation results show that, in the additive white Gaussian noise (AWGN) channels and the flash memory channels, as compared with the NMS algorithm, our algorithm significantly improves the decoding performance and the convergence speed.

Guangdong University of Technology (CN)
Openalex Percentile: Top 72%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.