.png){kind=icon}
Return
Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach
.png){kind=icon}
PRE
AI
DOI：10.1109/TIT.2025.3638148.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An analytical framework integrating performance characterization and coding theory is proposed to mitigate sneak path (SP) interference in resistive random-access memory (ReRAM) crossbar arrays. The core innovation is identified in the mathematical decomposition of ReRAM's non-ergodic data-dependent channel into multiple stationary memoryless subchannels. Through information-theoretic analysis, an approximate finite-length characterization of the theoretical lower bound for decoding word error probability (WEP) is established. This is achieved by systematically analyzing the SP occurrence rate in constrained array geometries combined with comprehensive evaluation of both mutual information and dispersion metrics across the decomposed channel components. Building upon this decomposition paradigm, a systematic code construction methodology is developed using density evolution principles for sparse-graph code design. The designed codes not only exhibit capacity-approaching decoding thresholds but also yield word error rate simulation results that are close to the derived WEP bound under practical crossbar configurations.
Keywords:
Codes
Arrays
Resistance
Decoding
Information theory
Interference
Electrical resistance measurement
Probability density function
Numerical models
Technological innovation
Non-volatile memory (NVM)
resistive random-access memory (ReRAM)
sneak path
channel decomposition
code design
Journal
I
IF:
2.9
Papers:
317
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
ShareSave
View more