Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach

2024/12/09 by Guanghui Song, Mei Gao, Song, Guanghui +6
Computer Science · Engineering · #Advanced Memory and Neural Computing #FOS: Computer and information sciences #Ferroelectric and Negative Capacitance Devices #Information Theory (cs.IT) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2412.06275

openalex publication_date 2024/12/09 · openalex created_date 2024/12/12 · openalex updated_date 2026/07/28

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.

Related

• Performance Limit and Coding Schemes for Resistive Random-Access Memory Channels
• Maximum Achievable Rate of Resistive Random-Access Memory Channels by Mutual Information Spectrum Analysis
• Sneak Path Interference-Aware Adaptive Detection and Decoding for Resistive Memory Arrays
• Constrained Coding and Deep Learning Aided Threshold Detection for Resistive Memories
• Quantization Design for Resistive Memories With Multiple Reads