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 rat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2025 IEEE/CIC International Conference on Communications in China (ICCC) s. 1 - 6
Hlavní autoři: Yu, Min, Zhai, Xiongfei, Hu, Mengxin, Tao, Shunyou, Fang, Yi, Han, Guojun
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 10.08.2025
Témata:
adaptive normalized factor
AWGN channels
Convergence
Decoding
Flash memories
GC-LDPC codes
Heuristic algorithms
Iterative decoding
NMS algorithm
Simulation
two-level decoding
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
DOI:10.1109/ICCC65529.2025.11149292