Sneak Path-Aware Reliability-Based Iterative Majority-Logic Decoding Algorithms for LDPC Codes in ReRAM Systems

The performance of classical channel decoding algorithms in resistive random access memory (ReRAM) channels is severely degraded due to the sneak path interference (SPI) caused by the crossbar array structure. In this letter, we first propose a sneak path-aware reliability-based iterative majority-l...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 29; číslo 9; s. 2018 - 2022
Hlavní autori: Kong, Lingjun, Qi, Yingnan, Liu, Haiyang, Meng, Chao
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.09.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Arrays
Codes
Computational efficiency
Computer architecture
Computing costs
Decoding
Error correcting codes
Error correction
Interference
Iterative decoding
iterative majority-logic decoding
low-density parity-check codes
Random access memory
Reliability
Resistance
Resistive RAM
Resistive random access memory
sneak path distance
sneak path interference
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The performance of classical channel decoding algorithms in resistive random access memory (ReRAM) channels is severely degraded due to the sneak path interference (SPI) caused by the crossbar array structure. In this letter, we first propose a sneak path-aware reliability-based iterative majority-logic decoding (SPR-IMLGD) algorithm for low-density parity-check (LDPC) codes by integrating the sneak path information into reliability metrics. In particular, we introduce the sneak path distance, derived from the associated sneak path probability, which provides a desirable characterization of the presence and extent of sneak paths within a given memory cell. Moreover, we present an enhanced version of the SPR-IMLGD algorithm (ESPR-IMLGD) that further improves the error correction performance. We also optimize the calculation of sneak path distance, ensuring that the SPR-IMLGD and ESPR-IMLGD algorithms have the same level of computational complexity. Simulation results demonstrate that the SPR-IMLGD and ESPR-IMLGD algorithms can achieve better performance with lower computational cost compared with the existing methods.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2025.3584075