Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach
Information Theory
2024-12-10 v1 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2412.06275,
title = {Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach},
author = {Guanghui Song and Meiru Gao and Ying Li and Bin Dai and Kui Cai},
journal= {arXiv preprint arXiv:2412.06275},
year = {2024}
}