Performance Limit and Coding Schemes for Resistive Random-Access Memory Channels
Guanghui Song, Kui Cai, Xingwei Zhong, Jiang Yu, and Jun Cheng

TL;DR
This paper introduces a novel coding strategy for ReRAM channels that mitigates sneak-path interference and noise, leveraging across-array coding and real-time channel estimation to approach the channel capacity.
Contribution
It proposes an across-array coding scheme with real-time channel estimation to combat data-dependent interference in ReRAM, achieving near-capacity storage efficiency.
Findings
The coding scheme effectively mitigates sneak-path interference.
Achieves near-capacity storage efficiency.
Provides capacity bounds for the ReRAM channel.
Abstract
Resistive random-access memory (ReRAM) is a promising candidate for the next generation non-volatile memory technology due to its simple read/write operations and high storage density. However, its crossbar array structure causes a severe interference effect known as the "sneak path." In this paper, we propose channel coding techniques that can mitigate both the sneak-path interference and the channel noise. The main challenge is that the sneak-path interference is data-dependent, and also correlated within a memory array, and hence the conventional error correction coding scheme will be inadequate. In this work, we propose an across-array coding strategy that assigns a codeword to multiple independent memory arrays, and exploit a real-time channel estimation scheme to estimate the instantaneous status of the ReRAM channel. Since the coded bits from different arrays experience…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Advanced Data Storage Technologies · Ferroelectric and Negative Capacitance Devices
