A novel framework for performance analysis and code design is proposed to address the sneak path (SP) problem in resistive random-access memory (ReRAM) arrays. The main idea is to decompose the ReRAM channel, which is both non-ergodic and data-dependent, into multiple stationary memoryless channels. A finite-length performance bound is derived by analyzing the capacity and dispersion of these stationary memoryless channels. Furthermore, leveraging this channel decomposition, a practical sparse-graph code design is proposed using density evolution. The obtained channel codes are not only asymptotic capacity approaching but also close to the derived finite-length performance bound.

翻译：本文提出了一种新颖的性能分析与编码设计框架，以解决阻变存储器阵列中的潜行路径问题。其核心思想是将既非遍历又依赖数据的ReRAM信道分解为多个平稳无记忆信道。通过分析这些平稳无记忆信道的容量与色散，推导出有限码长下的性能界。进一步，利用该信道分解方法，结合密度进化理论提出了一种实用的稀疏图编码设计方案。所获得的信道编码不仅渐近逼近容量，而且接近所推导的有限码长性能界。